Geometric mean labeling on Degree splitting graphs. (3rd March 2016)

• Record Type: Journal Article
• Authors: Somasundaram, S.; Sandhya, S. S.; Viji, S. P.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 2(2016)
• Page Start: 305
• Page End: 320
• Publication Date: 2016-03-03
• Subjects: Graph -- Path -- Comb Degree splitting graphs -- Geometric mean graph -- Union of graphs; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2015.1084781
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: A Graph G = ( V, E ) with p vertices and q edges is said to be a Geometric mean graph if it is possible to label the vertices x ϵ V with distinct labels f ( x ) from 1, 2 … … … … q + 1 in such a way that when each edge e = uv is labeled with f ( e = uv ) = ⌈ f ( u ) f ( v )⌉ or ⌊ f ( u ) f ( v )⌋, then the resulting edge labels are distinct. In this case, f is called Geometric mean labeling of G . In this paper we study the Geometric mean labeling on Degree Splitting graphs.