The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications

DOI10.1016/j.aml.2007.12.020zbMath1184.05114OpenAlexW2051752542MaRDI QIDQ1003574

Kin Keung Poon, Zhendong Shao, Roger K.-C. 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

channel assignment\(L(2, 1)\)-labeling\(K_{1,n}\)-free simple graphunit sphere graph

Mathematics Subject Classification ID

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

Related Items (5)

Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs ⋮ Distance edge coloring and collision‐free communication in wireless sensor networks ⋮ \(L(2,1)\)-labelings on the modular product of two graphs ⋮ An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs ⋮ \( L ( 2 , 1 )\)-labeling of disk intersection graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(T\)-colorings of graphs: recent results and open problems
• Parallel concepts in graph theory
• On \(L(d,1)\)-labelings of graphs
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• The L(2,1)-labeling and operations of graphs
• The $L(2,1)$-Labeling Problem on Graphs
• The edge span of distance two labellings of graphs

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