Radio number for total graph of paths
type: Item
instance of: scholarly article
title: Radio number for total graph of paths
zbMATH Open document ID: 1264.05045
DOI: 10.1155/2013/326038
published in: ISRN Combinatorics
publication date: 2013-06-03T00:00:00Z
review text: Summary: A radio labeling of a graph \(G\) is a function \(f\) from the vertex set \(V(G)\) to the set of nonnegative integers such that \(|f(u) - f(v)| \geq \text{diam}(G) + 1 - d_G(u, v)\), where \(\operatorname{diam}(G)\) and \(d_G(u, v)\) are diameter and distance between \(u\) and \(v\) in graph \(G\), respectively. The radio number \(\operatorname{rn}(G)\) of \(G\) is the smallest number \(k\) such that \(G\) has radio labeling with \(\max\{f(v) : v \in V(G)\} = k\). We investigate the radio number for the total graphs of paths.
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6169797
zbMATH Keywords: radio labeling
zbMATH Keywords: radio network
zbMATH Keywords: diameter
zbMATH Keywords: distance
zbMATH Keywords: total graph
zbMATH Keywords: paths
author: S. K. Vaidya
author: D. D. Bantva
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/326038
OpenAlex ID: W1970855344
Wikidata QID: Q58994161
cites work: \(T\)-colorings of graphs: recent results and open problems
cites work: Labelling Graphs with a Condition at Distance 2
cites work: A survey on labeling graphs with a condition at distance two
cites work: Labeling Chordal Graphs: Distance Two Condition
cites work: The $L(2,1)$-Labeling Problem on Graphs
cites work: Q3161389
cites work: Q5199530
cites work: Radio labelings of graphs
cites work: Multilevel Distance Labelings for Paths and Cycles
cites work: Q4677958
cites work: Q3073573
cites work: Radio number for trees
cites work: \(E_{11}\) and M theory
description: scientific article; zbMATH DE number 6169797