Radio labelling of two-branch trees

DOI10.1016/J.AMC.2024.129097MaRDI QIDQ6993925zbMATH OpenFDO

Authors D. D. Bantva, S. K. Vaidya, Sanming Zhou

Publication date 24 April 2025

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2024.129097

zbMATH Keywords

graph colouringlevel-wise regular treesradio labellingradio numbertrees

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• A survey on labeling graphs with a condition at distance two
• Distance-constrained labeling of complete trees
• Further results on the radio number of trees
• scientific article; zbMATH DE number 2154968 (Why is no real title available?)
• Improved lower bounds for the radio number of trees
• Labelling Graphs with a Condition at Distance 2
• Multilevel Distance Labelings for Paths and Cycles
• Optimal radio labellings of complete m-ary trees
• Radio labelings of graphs
• Radio number for trees
• Radio number of trees
• The radio numbers of all graphs of order n and diameter n-2

This page was built for publication: Radio labelling of two-branch trees

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