The L(2,1)-labeling of K₁,n-free graphs and its applications

DOI10.1016/J.AML.2007.12.020MaRDI QIDQ1003574zbMATH OpenOpenAlexFDO

Authors Zhendong Shao, Kin Keung Poon, Roger K. Yeh, Wai Chee Shiu

Publication date 4 March 2009

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2007.12.020

zbMATH Keywords

\(K_{1,n}\)-free simple graph\(L(2, 1)\)-labelingchannel assignmentunit sphere graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• The L (3, 2, 1)-labeling problem on graphs
• scientific article; zbMATH DE number 2145257
• L(2,1)-labeling of graphs: known results and open problems
• scientific article; zbMATH DE number 6940804
• Core graphs and L(2,1)-labeling

Cites work

• -coloring of graphs
• \(T\)-colorings of graphs: recent results and open problems
• A Theorem about the Channel Assignment Problem
• Fixed-parameter complexity of \(\lambda\)-labelings
• scientific article; zbMATH DE number 1792593 (Why is no real title available?)
• scientific article; zbMATH DE number 841588 (Why is no real title available?)
• scientific article; zbMATH DE number 881282 (Why is no real title available?)
• scientific article; zbMATH DE number 1409224 (Why is no real title available?)
• scientific article; zbMATH DE number 5036064 (Why is no real title available?)
• Labeling Chordal Graphs: Distance Two Condition
• Labelling Graphs with a Condition at Distance 2
• On L(2,1)-labelings of Cartesian products of paths and cycles
• On \(L(d,1)\)-labelings of graphs
• Parallel concepts in graph theory
• Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
• The $L(2,1)$-Labeling Problem on Graphs
• The edge span of distance two labellings of graphs
• The L(2,1)-labeling and operations of graphs

Cited in

(10)

• A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\)
• \( L ( 2 , 1 )\)-labeling of disk intersection graphs
• L(2,1)-labelings on the modular product of two graphs
• Online coloring and L(2,1)-labeling of unit disk intersection graphs
• scientific article; zbMATH DE number 749300 (Why is no real title available?)
• L(2,1)-labeling of Kneser graphs and coloring squares of Kneser graphs
• Core graphs and L(2,1)-labeling
• Distance edge coloring and collision-free communication in wireless sensor networks
• An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs
• L(2,1,1)-labeling of interval graphs

This page was built for publication: The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003574)