Abstract
Let G be a graph. An injective map is called a pair sum labeling if the induced edge function, defined by is one-one and is either of the form or according as q is even or odd. A graph with a pair sum labeling is called a pair sum graph. In this paper we investigate the pair sum labeling behavior of subdivision of some standard graphs.
Highlights
The graphs considered here will be finite, undirected and simple
In this paper we investigate the pair sum labeling behavior of subdivision of some standard graphs
The corona G1G2 of two graphs G1 and G2 is defined as the graph obtained by taking one copy of G1 and p1 copies of G2 and joining the ith vertex of G1 to all the vertices in the ith copy of G2
Summary
V G and E G will denote the vertex set and edge set of a graph G. The graph obtained by subdividing each edge of a graph G is called the subdivision graph of G and it is denoted by. A dragon is a graph formed by joining an end vertex of a path Pm to a vertex of the cycle Cn. A dragon is a graph formed by joining an end vertex of a path Pm to a vertex of the cycle Cn It is denoted as Cn @ Pm. The triangular snake Tn is obtained from the path Pn by replacing every edge of a path by a triangle C3. The Pair sum labeling behavior of some standard graphs like complete graph, cycle, path, bistar, and some more standard graphs are investigated in [1,2,3]. We investigate the pair sum labeling behavior of S G , for some standard graphs G
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call