Multilevel Bandwidth and Radio Labelings of Graphs

DOI10.1007/978-3-540-77891-2_22MaRDI QIDQ5452169zbMATH OpenOpenAlexFDO

Authors 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 assignmentgeneralized graph bandwidthradio labeling

Mathematics Subject Classification ID

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

Recommendations

• New results on radio \(k\)-labelings of distance graphs
• scientific article; zbMATH DE number 2154968
• Optimal radio-\(k\)-labelings of trees
• Linear and cyclic radio k-labelings of trees
• Radio number of some wheel related graphs

Cites work

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

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

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