A characterization of _d,1-minimal trees and other attainable classes

DOI10.1016/J.DISC.2008.05.009MaRDI QIDQ1025490zbMATH OpenOpenAlexFDO

Authors Elizabeth Jonck, Johannes H. Hattingh, C. J. Ras

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

1)\)-labelings\(\lambda \)-minimal trees\(L(2\(L(dchannel assignmentdistance two labeling

Mathematics Subject Classification ID

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

Recommendations

• A characterisation of universal minimal total dominating functions in trees
• Some upper bounds for minimal trees
• scientific article; zbMATH DE number 1507962
• On the number of minimal dominating sets in some classes of trees
• scientific article; zbMATH DE number 5942290
• Minimal trees and monophonic convexity
• Complete characterization of the minimal-ABC trees
• A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
• scientific article; zbMATH DE number 5995289
• A characterization of (_t,_2)-trees

Cites work

• Distance-two labelings of graphs
• scientific article; zbMATH DE number 1185300 (Why is no real title available?)
• Labeling trees with a condition at distance two.
• Labelling Graphs with a Condition at Distance 2
• On \(L(d,1)\)-labelings of graphs
• The $L(2,1)$-Labeling Problem on Graphs

Cited in

(4)

• A class of full (d,1)-colorable trees
• The L (d,1)-T labeling on claw-free graphs and splitted graphs
• Correlated topographic analysis: estimating an ordering of correlated components
• \(L(j,k)\)-labelling and maximum ordering-degrees for trees

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

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