Radio number for middle graph of paths
Author:
Preprint
Abstract
For a connected graph $G$, let $diam(G)$ and $d(u,v)$ denote the diameter of $G$ and distance between $u$ and $v$ in $G$. A radio labeling of a graph $G$ is a mapping $\varphi : V(G) \rightarrow \{0,1,2,...\}$ such that $|\varphi(u)-\varphi(v)| \geq diam(G) + 1 - d(u,v)$ for every pair of distinct vertices $u, v$ of $G$. The span of $\varphi$ is defined as span($\varphi$) = $\max\{|\varphi(u)-\varphi(v)| : u, v \in V(G)\}$. The radio number $rn(G)$ of $G$ is defined as $rn(G)$ = $\min\{$span($\varphi$) : $\varphi$ is a radio labeling of $G\}$. In this paper, we determine the radio number for middle graph of paths.
Keywords
All Related Versions
- Version 1, 2018-05-25, ArXiv
- Published version: Electronic Notes in Discrete Mathematics, 63, 93.
This publication has 8 references indexed in Scilit:
- Radio number of treesDiscrete Applied Mathematics, 2017
- Radio Number for Total Graph of PathsISRN Combinatorics, 2013
- The L(h, k)-Labelling Problem: An Updated Survey and Annotated BibliographyThe Computer Journal, 2011
- A survey on labeling graphs with a condition at distance twoDiscrete Mathematics, 2006
- Multilevel Distance Labelings for Paths and CyclesSIAM Journal on Discrete Mathematics, 2005
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- T-colorings of graphs: recent results and open problemsDiscrete Mathematics, 1991
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980