Labeling graphs with two distance constraints

DOI10.1016/J.DISC.2007.10.036zbMATH Open1188.05111OpenAlexW2023125314MaRDI QIDQ998444

J. Martínez

Publication date: 28 January 2009

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

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

zbMATH Keywords

treepowerpathCartesian product\(L(2, 1)\)-labeling\(L(d_{1}, d_{2},p, q)\)-labeling

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Relating path coverings to vertex labellings with a condition at distance two
• On \(L(d,1)\)-labelings of graphs
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs

Related Items (1)

Unnamed Item

This page was built for publication: Labeling graphs with two distance constraints