Antipodal number of full \(m\)-ary trees

DOI10.1016/j.tcs.2021.06.034OpenAlexW3176660058MaRDI QIDQ1981781

Laxman Saha, Satyabrata Das, Kalishankar Tiwary, Alamgir Rahaman Basunia

Publication date: 6 September 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.034

zbMATH Keywords

frequency assignment problemradio labelingradio numberspanantipodal number

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Antipodal radio labelling of full binary trees
• Improved lower bounds for the radio number of trees
• Optimal radio-\(k\)-labelings of trees
• Distance-constrained labeling of complete trees
• Radio number for trees
• The Radio Number of $C_n \square C_n$
• A Graph Radio k-Coloring Algorithm
• Radio numbers for generalized prism graphs
• Labelling Graphs with a Condition at Distance 2
• Radio $k$-labeling of paths
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: Antipodal number of full \(m\)-ary trees