-Labelings on the composition of graphs
Authors:
- Zhendong ShaoZSZhendong Shao
- Roberto Solis-ObaRSRoberto Solis-Oba
- 1 July 2010
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 411 (34-36) , 3287-3292
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The /spl Delta//sup 2/-conjecture for L(2,1)-labelings is true for direct and strong products of graphsIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 2006
- The L(h, k)-Labelling Problem: A Survey and Annotated BibliographyThe Computer Journal, 2006
- A Theorem about the Channel Assignment ProblemSIAM Journal on Discrete Mathematics, 2003
- Labeling Products of Complete Graphs with a Condition at Distance TwoSIAM Journal on Discrete Mathematics, 2001
- On L(d,1)-labelings of graphsDiscrete Mathematics, 2000
- The $L(2,1)$-Labeling Problem on GraphsSIAM Journal on Discrete Mathematics, 1996
- Relating path coverings to vertex labellings with a condition at distance twoDiscrete Mathematics, 1994
- A neural network parallel algorithm for channel assignment problems in cellular radio networksIEEE Transactions on Vehicular Technology, 1992
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980