Antipodal radio labelling of full binary trees

DOI10.1007/978-3-030-57602-8_41zbMath1482.05289OpenAlexW3047679477MaRDI QIDQ2039697

Kalishankar Tiwary, Satabrata Das, Laxman Saha

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_41

zbMATH Keywords

treefrequency assignment problemspanradio \(k\)-labellingradio antipodal number

Mathematics Subject Classification ID

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

Related Items (2)

Antipodal number of full \(m\)-ary trees ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees

Cites Work

• On characterizing radio \(k\)-coloring problem by path covering problem
• A lower bound for radio \(k\)-chromatic number
• A lower bound technique for radio \(k\)-coloring
• Optimal radio labellings of complete \(m\)-ary trees
• A channel assignment problem for optical networks modelled by Cayley graphs
• Radio number for trees
• A Graph Radio k-Coloring Algorithm
• Multilevel Distance Labelings for Paths and Cycles
• Radio number of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Antipodal radio labelling of full binary trees