The -labeling on graphs and the frequency assignment problem
Authors:
- Zhendong ShaoZSZhendong Shao
- David ZhangDZDavid Zhang
- 1 January 2008
- journal article
- Published by Elsevier in Applied Mathematics Letters
- Vol. 21 (1) , 37-41
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On L(2,1)-labelings of Cartesian products of paths and cyclesDiscrete Mathematics, 2004
- A Theorem about the Channel Assignment ProblemSIAM Journal on Discrete Mathematics, 2003
- Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete TreesJournal of Parallel and Distributed Computing, 2002
- 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
- Labeling Chordal Graphs: Distance Two ConditionSIAM Journal on Discrete Mathematics, 1994
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980