Optimal Radio Labellings of Block Graphs and Line Graphs of Trees
From MaRDI portal
Abstract: A radio labeling of a graph is a mapping : such that holds for every pair of vertices and , where is the diameter of and is the distance between and in . The radio number of , denoted by , is the smallest such that admits a radio labeling with . A block graph is a graph such that each block (induced maximal 2-connected subgraph) is a complete graph. In this paper, a lower bound for the radio number of block graphs is established. The block graph which achieves this bound is called a lower bound block graph. We prove three necessary and sufficient conditions for lower bound block graphs. Moreover, we give three sufficient conditions for a graph to be a lower bound block graph. Applying the established bound and conditions, we show that several families of block graphs are lower bound block graphs, including the level-wise regular block graphs and the extended star of blocks. The line graph of a graph has as the vertex set, where two vertices are adjacent if they are incident edges in . We extend our results to trees as trees and its line graphs are block graphs. We prove that if a tree is a lower bound block graph then, under certain conditions, its line graph is also a lower bound block graph, and vice versa. Consequently, we show that the line graphs of many known lower bound trees, excluding paths, are lower bound block graphs.
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 Q6376251)