Distance two labelling and direct products of graphs

DOI10.1016/J.DISC.2007.06.046zbMath1188.05121OpenAlexW1983237515MaRDI QIDQ932631

Peter Che Bor Lam, Wensong Lin

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.06.046

zbMATH Keywords

direct product\(L(2,1)\)-labelling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (7)

\(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle ⋮ L(1,1)-Labeling of direct product of cycles ⋮ L(2, 1)-labellings for direct products of a triangle and a cycle ⋮ On circular-L(2, 1)-labellings of products of graphs ⋮ THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE ⋮ Radio number for the product of a path and a complete graph

Cites Work

• Relating path coverings to vertex labellings with a condition at distance two
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Distance two labelling and direct products of graphs