Labeling trees with a condition at distance two

DOI10.1016/J.DISC.2005.04.024MaRDI QIDQ5920600zbMATH OpenOpenAlexFDO

Authors Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi

Publication date 4 August 2006

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(L(h,k)\)-labelingmaximum degreetreevertex labeling

Mathematics Subject Classification ID

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

Recommendations

• The L(2,1)-labelling of trees
• Labeling trees with a condition at distance two.
• The \(L(h,1,1)\)-labelling problem for trees
• Distance three labelings of trees
• A complete \(L (2, 1)\) span characterization for small trees

Cites work

• 25 pretty graph colouring problems
• \(L(h,1)\)-labeling subclasses of planar graphs
• Exact solution of a class of frequency assignment problems in cellular networks (extended abstract)
• Graph labeling and radio channel assignment
• scientific article; zbMATH DE number 2086232 (Why is no real title available?)
• scientific article; zbMATH DE number 6118222 (Why is no real title available?)
• scientific article; zbMATH DE number 1185300 (Why is no real title available?)
• scientific article; zbMATH DE number 1953160 (Why is no real title available?)
• scientific article; zbMATH DE number 1500531 (Why is no real title available?)
• scientific article; zbMATH DE number 881282 (Why is no real title available?)
• scientific article; zbMATH DE number 1409224 (Why is no real title available?)
• scientific article; zbMATH DE number 1439442 (Why is no real title available?)
• Labeling Chordal Graphs: Distance Two Condition
• Labeling products of complete graphs with a condition at distance two
• Labeling trees with a condition at distance two.
• Labelling Graphs with a Condition at Distance 2
• Models and solution techniques for frequency assignment problems
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs

Cited in

(27)

• The \(L(d,1)\)-number of powers of paths
• Labeling trees with a condition at distance two.
• Facial \(L(2, 1)\)-edge-labelings of trees
• \(L(j,k)\)-labeling numbers of square of paths
• On a distance-constrained graph labeling to model cooperation
• Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers
• Distance-constrained labeling of complete trees
• \(L(j, k)\)-number of direct product of path and cycle
• Circular \(L(j,k)\)-labeling number of direct product of path and cycle
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
• L(1, 2)-edge-labelings for lattices
• A class of full (d,1)-colorable trees
• \(L(s, t)\) edge spans of trees and product of two paths
• L(p,2,1)-labeling of the infinite regular trees
• \(L(1, 2)\)-labeling numbers on square of cycles
• scientific article; zbMATH DE number 5938583 (Why is no real title available?)
• Optimal \(L(h,k)\)-labeling of regular grids
• On critical trees labeled with a condition at distance two
• Graph-Theoretic Concepts in Computer Science
• \(L(h,k)\) labelings of \(K_n-M\) and \(K_n-P_m\) for all values of \(h\) and \(k^\ast\)
• L(j,k)-labeling number of Cartesian product of path and cycle
• Linear and cyclic distance-three labellings of trees
• List version of L(d,s)-labelings
• A complete \(L (2, 1)\) span characterization for small trees
• Graph labellings with variable weights, a survey
• \(L(j,k)\)-labelling and maximum ordering-degrees for trees
• The \(L(h,1,1)\)-labelling problem for trees

Describes a project that uses

Uses Software

• CALMA

This page was built for publication: Labeling trees with a condition at distance two

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