Recent progress in mathematics and engineering on optimal graph labellings with distance conditions-Reference-Cited by-同舟云学术

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions

Published:2007-03-31 Issue:2-3 Volume:14 Page:249-257
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Griggs Jerrold R.,Jin Xiaohua Teresa

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-007-9055-7.pdf

Reference53 articles.

1. Anand S, Sridharan A, Sivarajan KN (2003) Performance analysis of channelized cellular systems with dynamic channel allocation. IEEE Trans Veh Tech 52(4):847–859

2. Barcaccia P, Bonuccelli MA (1994) Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems. IEEE/ACM Trans Netw 2:247–251

3. Battiti R, Bertossi A, Cavallaro D (2001) A randomized saturation degree heuristic for channel assignment in cellular radio networks. IEEE Trans Veh Tech 50(2):364–374

4. Bertossi AA, Bonuccelli MA (1995) Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans Netw 3:441–449

5. Bertossi AA, Pinotti CM, Rizzi R, Shende AM (2003) Channel assignment in honeycomb networks. In: 8th Italian conf on theor comp sci (ICTCS2003). Lecture notes in computer science, vol 2841, pp 150–162

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. L(1, 2)-labeling numbers on square of cycles;AKCE International Journal of Graphs and Combinatorics;2020-06-09

2. Channel assignment problem and n-fold t-separated $$L(j_1,j_2,\ldots ,j_m)$$ L ( j 1 , j 2 , … , j m ) -labeling of graphs;Journal of Combinatorial Optimization;2018-02-20

3. L(j,k)-labeling numbers of square of paths;AKCE International Journal of Graphs and Combinatorics;2017-12-01

4. Distance multi‐labelling of graphs with weighted vertices;IET Communications;2017-11

5. On (s,t)-relaxed L(1,1)-labelling of trees;International Journal of Computer Mathematics;2016-05-27