L(j,k)-labelling and maximum ordering-degrees for trees

DOI10.1016/J.DAM.2009.11.018MaRDI QIDQ968198zbMATH OpenOpenAlexFDO

Authors Justie Su-tzu Juan, Daphne Der-Fen Liu, Li-Yueh Chen

Publication date 5 May 2010

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

Full work available at URL https://doi.org/10.1016/j.dam.2009.11.018

zbMATH Keywords

treeschannel assignment problemdistance-two labelling

Mathematics Subject Classification ID

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

Recommendations

• The L(2,1)-labelling of trees
• A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
• Labeling trees with a condition at distance two
• Labeling trees with a condition at distance two.
• Distance-two labelings of graphs

Cites work

• scientific article; zbMATH DE number 1185300 (Why is no real title available?)
• scientific article; zbMATH DE number 1409224 (Why is no real title available?)
• A bound on the chromatic number of the square of a planar graph
• A survey on labeling graphs with a condition at distance two
• Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
• Distance-two labelings of graphs
• Labeling Chordal Graphs: Distance Two Condition
• Labeling trees with a condition at distance two.
• Labelling Graphs with a Condition at Distance 2
• On \(L(d,1)\)-labelings of graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
• Pair Labellings with Given Distance
• Real Number Channel Assignments for Lattices
• Real Number Graph Labellings with Distance Conditions
• The $L(2,1)$-Labeling Problem on Graphs
• \(L(h,1)\)-labeling subclasses of planar graphs

Cited in

(3)

• The \((p,q)\)-total labeling problem for trees
• A characterization of L(2, 1)-labeling number for trees with maximum degree 3
• \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs

This page was built for publication: \(L(j,k)\)-labelling and maximum ordering-degrees for trees

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