A survey on labeling graphs with a condition at distance two-Reference-Cited by-同舟云学术

A survey on labeling graphs with a condition at distance two

Published:2006-06 Issue:12 Volume:306 Page:1217-1231
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Yeh Roger K.

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference59 articles.

1. On powers of chordal graphs and their colorings;Agnarsson;Congr. Numer.,2000

2. A randomized saturation-degree heuristic for channel assignment in cellular radio networks;Battiti;IEEE Trans. Vehicular Tech.,2001

3. Code assignment for hidden terminal interference avoidance in multihop packet radio networks;Bertossi;IEEE/ACM Trans. Networking,1995

4. A.A. Bertossi, M.C. Pinotti, R. Rizzi, Channel assignment on strongly-simplicial graphs, IEEE Proceedings of the International Parallel and Distribution Processing Symposium, 2003.

5. Channel assignment with separation for interference avoidance in wireless networks;Bertossi;IEEE Trans. Parallel Distrib. Systems,2003

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

1. Optimal L (3,2,1)-labeling of trees;AKCE International Journal of Graphs and Combinatorics;2024-06-06

2. n-fold L(2, 1)-labelings of Cartesian product of paths and cycles;Journal of Combinatorial Optimization;2024-04

3. Optimal radio labelings of the Cartesian product of the generalized Peterson graph and tree;Discrete Mathematics, Algorithms and Applications;2024-02-23

4. Lambda number of the enhanced power graph of a finite group;Journal of Algebra and Its Applications;2024-02-14

5. Labeling Circulant Graphs: Distance Two Condition;Symmetry;2023-12-05