On (s,t)-relaxed L(1,1)-labelling of trees

DOI10.1080/00207160.2016.1188922zbMath1367.05186OpenAlexW2471415495MaRDI QIDQ4976318

No author found.

Publication date: 28 July 2017

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2016.1188922

zbMATH Keywords

treechannel assignment\((s,t)\)-relaxed \(L(1,1)\)-labelling\(L(j,k)\)-labellingcomplete \(\Delta\)-regular tree

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Channel models (including quantum) in information and communication theory (94A40)

Related Items (2)

On \(t\)-relaxed 2-distant circular coloring of graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs

Cites Work

• Relaxed coloring of a graph
• Weighted improper colouring
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
• A survey on labeling graphs with a condition at distance two
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Labelling Graphs with a Condition at Distance 2
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• The $L(2,1)$-Labeling Problem on Graphs
• On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs

This page was built for publication: On (s,t)-relaxed L(1,1)-labelling of trees