Radio Number for Total Graph of Paths. (13th January 2013)

• Record Type: Journal Article
• Authors: Vaidya, S. K.; Bantva, D. D.
• Other Names: Godbole A. P. Academic Editor.; Kim D. S. Academic Editor.
• Is Part Of: ISRN combinatorics. Volume 2013(2013)
• Publication Date: 2013-01-13
• Subjects: Combinatorial analysis -- Periodicals; Combinatorial analysis; Electronic journals; Periodicals; 511.6
• DOI: 10.1155/2013/326038
• Languages: English
• ISSNs: 2090-8911

Abstract

Abstract : 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 ) | ≥ diam ( G ) + 1 - d G ( u, v ), where diam ( G ) and d G ( u, v ) are diameter and distance between u and v in graph G, respectively. The radio number r n ( G ) of G is the smallest number k such that G has radio labeling with max { f ( v ) : v ∈ V ( G ) } = k . We investigate radio number for total graph of paths.