Multilevel Bandwidth and Radio Labelings of Graphs

DOI10.1007/978-3-540-77891-2_22zbMath1132.05323OpenAlexW1530880585MaRDI QIDQ5452169

Riadh Khennoufa, Olivier Togni

Publication date: 25 March 2008

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77891-2_22

zbMATH Keywords

frequency assignmentradio labelinggeneralized graph bandwidth

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph bandwidth of weighted caterpillars
• An extremal graph with given bandwidth
• Bandwidth of the Cartesian product of two connected graphs
• The bandwidth sum of join and composition of graphs
• Radio antipodal colorings of graphs
• The bandwidth problem for graphs and matrices—a survey
• Radio k-colorings of paths
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: Multilevel Bandwidth and Radio Labelings of Graphs