Optimal radio labellings of block graphs and line graphs of trees

DOI10.1016/J.TCS.2021.08.029MaRDI QIDQ2235749zbMATH OpenOpenAlexFDO

Authors Daphne Der-Fen Liu, D. D. Bantva

Publication date 21 October 2021

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/2108.12754

zbMATH Keywords

block graphextended star of blockslevel-wise regular block graphline graphradio labelingradio numbertree

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Radio number of trees
• Radio number of trees
• Optimal radio labelings of graphs
• Improved lower bounds for the radio number of trees
• Optimal radio-\(k\)-labelings of trees

Cites work

• A channel assignment problem for optical networks modelled by Cayley graphs
• A distance-labelling problem for hypercubes
• A lower bound for radio \(k\)-chromatic number
• A lower bound technique for radio k-coloring
• A survey on labeling graphs with a condition at distance two
• Distance-constrained labeling of complete trees
• scientific article; zbMATH DE number 2154968 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (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
• On the radio number of toroidal grids
• Optimal radio labellings of complete m-ary trees
• Optimal radio-\(k\)-labelings of trees
• Radio graceful Hamming graphs
• Radio labelings of graphs
• Radio number for strong product P₂ P_n
• Radio number for total graph of paths
• Radio number for trees
• Radio number of trees
• Radio number of trees
• Radio numbers for generalized prism graphs
• The Channel Assignment Problem with Variable Weights
• The radio antipodal and radio numbers of the hypercube.
• The radio number of \(C_n\square C_n\).

Cited in

(9)

• Radio-\(k\)-labeling of cycles for large \(k\)
• Radio number for the Cartesian product of two trees
• Optimal Radio Labellings of Block Graphs and Line Graphs of Trees
• A note proving the nullity of block graphs is unbounded
• A note on obtaining bipartite radio graceful graphs of arbitrarily large radio numbers with radio graceful complements
• Optimal radio labelings of the Cartesian product of the generalized Peterson graph and tree
• Radio labeling of biconvex split graphs
• Radio number of the Cartesian product of a tree and a complete graph
• Optimal radio labellings of complete m-ary trees

This page was built for publication: Optimal radio labellings of block graphs and line graphs of trees

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