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

DOI10.1016/J.DAM.2009.11.018zbMATH Open1225.05082OpenAlexW2000225603MaRDI QIDQ968198FDOQ968198

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

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

zbMATH Keywords

treeschannel assignment problemdistance-two labelling

Mathematics Subject Classification ID

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

Cites Work

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