A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes

DOI10.1016/j.disc.2008.05.009zbMath1211.05147OpenAlexW1979202068MaRDI QIDQ1025490

Elizabeth Jonck, Charl J. Ras, Johannes H. Hattingh

Publication date: 19 June 2009

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

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

zbMATH Keywords

channel assignment\(L(2distance two labeling\(L(d\(\lambda \)-minimal trees1)\)-labelings

Mathematics Subject Classification ID

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

Related Items (1)

Correlated topographic analysis: estimating an ordering of correlated components

Cites Work

• Unnamed Item
• Labeling trees with a condition at distance two.
• On \(L(d,1)\)-labelings of graphs
• Distance-two labelings of graphs
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes