ArticlePDF Available

Some More Results on Root Square Mean Graphs

Canadian Center of Science and Education
Journal of Mathematics Research
Authors:
Journal of Mathematics Research; Vol. 7, No. 1; 2015
ISSN 1916-9795 E-ISSN 1916-9809
Published by Canadian Center of Science and Education
72
Some More Results on Root Square Mean Graphs
S. S. Sandhya1, S. Somasundaram2 & S. Anusa3
1Department of Mathematics, Sree Ayyappa College for Women, Chunkankadai 629003, India.
2Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli 627012, India.
3Department of Mathematics, Arunachala College of Engineering for Women, Vellichanthai 629203, India.
Correspondence: S. Anusa, Department of Mathematics, Arunachala College of Engineering for Women, Vellichanthai
629203, India. E-mail: anu12343s@gmail.com
Received: October 23, 2014 Accepted: November 6, 2014 Online Published: February 17, 2015
doi:10.5539/jmr.v7n1p72 URL: http://dx.doi.org/10.5539/jmr.v7n1p72
Abstract
A graph 󰇛󰇜 with vertices and edges is called a Root Square Mean graph if it is possible to label
the vertices with distinct elements 󰇛󰇜 from  in such a way that when each edge 
is labeled with 󰇛󰇜󰇽󰇛󰇜󰇛󰇜
󰇾 or 󰇿󰇛󰇜󰇛󰇜
󰈀 , then the resulting edge labels are distinct. In
this case is called a Root Square Mean labeling of . The concept of Root Square Mean labeling was
introduced by (S. S. Sandhya, S. Somasundaram and S. Anusa). We investigated the Root Square Mean labeling
of several standard graphs such as Path, Cycle, Comb, Ladder, Triangular snake, Quadrilateral snake etc., In this
paper, we investigate the Root Square Mean labeling for Double Triangular snake, Alternate Double Triangular
snake, Double Quadrilateral snake, Alternate Double Quadrilateral snake, and Polygonal chain.
Keywords: Mean graph, Root Square Mean graph, Cycle, Triangular snake, Double Triangular snake,
Quadrilateral snake, Double Quadrilateral snake, Polygonal chain.
1. Introduction
The graph considered here will be finite, undirected and simple. The vertex set is denoted by 󰇛󰇜 and the edge
set is denoted by 󰇛󰇜.For all detailed survey of graph labeling we refer to Gallian (2010). For all other
standard terminology and notations we follow Harary (1988). A Triangular snake is obtained from a path
by joining and  to a new vertex for . A Double Triangular Snake
󰇛󰇜 consists of two Triangular snakes that have a common path. An Alternate Triangular snake 󰇛󰇜 is
obtained from a path by joining and  (Alternatively) to new vertex .An Alternate
Double Triangular Snake 󰇛󰇛󰇜󰇜 consists of two Alternate Triangular snakes that have a common path. A
Quadrilateral snake is obtained from a path by joining and  to new vertices and
respectively and then joining and. A Double Quadrilateral snake 󰇛󰇜 consists of two Quadrilateral
snakes that have a common path. An Alternate Quadrilateral snake 󰇛󰇜 is obtained from a path
by joining and (Alternatively) to new vertices and respectively and then joining and.An
Alternate Double Quadrilateral snake 󰇛󰇛󰇜󰇜 consists of two Alternate Quadrilateral snakes that have a
common path.A Polygonal chain  is a connected graph all of whose blocks are polygons on sides.
S. Somasundaram and R. Ponraj introduced the concept of mean labeling of graphs and investigated the mean
labeling of some standard graphs. S. Somasundaram and S. S. Sandhya introduced the concept of Harmonic
mean labeling of graphs. S. Somasundaram and P. Vidhya Rani introduced the concept of Geometric mean
labeling of graphs. In this paper we prove that Double Triangular snake, Alternate Double Triangular snake,
Double Quadrilateral snake, Alternate Double Quadrilateral snake and Polygonal Chains are Root Square mean
graphs.
We make frequent reference to the following results.
Theorem 1.1: (S. Somasundaram & R. Ponraj) Triangular snakes and Quadrilateral snakes are mean graphs.
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 7, No. 1; 2015
73
Theorem 1.2: (S. S. Sandhya, S. Somasundaram & S. Anusa) Double Triangular and Double Quadrilateral
snakes are mean graphs.
Theorem 1.3: (S. S. Sandhya & S. Somasundaram) Triangular snakes and Quadrilateral snakes are Harmonic
mean graphs.
Theorem 1.4: (C. Jaya Sekaran, S. S. Sandhya & C. David Raj) Double Triangular snakes and Alternate Double
Triangular snakes are Harmonic mean graphs.
Theorem 1.5: (C. David Raj, C. Jaya Sekaran & S. S. Sandhya) Double Quadrilateral and Alternate Double
Quadrilateral snakes are Harmonic mean graphs.
Theorem 1.6: (S. S. Sandhya & S. Somasundaram) Double Triangular snakes are Geometric mean graphs.
Theorem 1.7: (S. S. Sandhya & S. Somasundaram) Double Quadrilateral snakes are Geometric mean graphs.
2. Root Square Mean Labeling
Definition 2.1: A graph 󰇛󰇜 with vertices and edges is called a mean graph if it is possible to
label the vertices with distinct elements 󰇛󰇜 from in such a way that when each edge
 is labeled with 󰇛󰇜󰇱 󰇛󰇜󰇛󰇜
󰇛󰇜󰇛󰇜
󰇛󰇜󰇛󰇜
󰇛󰇜󰇛󰇜 , then the edge labels are distinct.
In this case is called Mean labeling of .
Definition 2.2: A graph with vertices and edges is called as Harmonic mean graph if it is possible to label
the vertices with distinct elements 󰇛󰇜 from  in such a way that when each edge
 is labeled with 󰇛󰇜󰇳󰇛󰇜󰇛󰇜
󰇛󰇜󰇛󰇜󰇴󰇵󰇛󰇜󰇛󰇜
󰇛󰇜󰇛󰇜󰇶, then the edge labels are distinct. In this case
is called Harmonic mean labeling of .
Definition 2.3: A graph with vertices and edges is called as Geometric mean graph if it is possible to label
the vertices with distinct elements 󰇛󰇜 from  in such a way that when each edge
 is labeled with 󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜 , then the edge labels are distinct. In this
case is called Geometric mean labeling of .
Definition 2.4: A graph with vertices and edges is called a Root Square mean graph if it is possible to
label the vertices with distinct elements 󰇛󰇜 from  in such a way that when each edge
 is labeled with 󰇛󰇜󰇽󰇛󰇜󰇛󰇜
󰇾󰇿󰇛󰇜󰇛󰇜
󰈀 , then the edge labels are distinct. In
this case is called Root Square mean labeling of .
Theorem 2.5: Double Triangular snakes 󰇛󰇜 are Root square mean graphs.
Proof: Consider a path .Join and  , to two new vertices , ,
.Define a function 󰇛󰇛󰇜󰇜󰇝󰇞 by
󰇛󰇜 󰇛󰇜 󰇛󰇜,
󰇛󰇜
󰇛󰇜.
The edges are labeled as
󰇛󰇜 󰇛󰇜
󰇛󰇜
󰇛󰇜 󰇛󰇜
󰇛󰇜
󰇛󰇜
Then the edge labels are distinct. Hence Double Triangular snakes are Root Square mean graphs.
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 7, No. 1; 2015
74
Example 2.6: Root Square mean labeling of 󰇛󰇜 is given below.
Figure 1
Theorem 2.7: Alternate Double Triangular snakes 󰇛󰇛󰇜󰇜 is a Root Square mean graph.
Proof: Let be the graph 󰇛󰇛󰇜󰇜. Consider a path .To construct , join and 
(Alternatively) with two new vertices and , .There are two different cases to be considered.
Case 1: If the Double Triangle starts from , then we consider two sub cases.
Sub Case 1(a): If is even, then
Define a function 󰇛󰇜󰇝󰇞 by
󰇛󰇜󰇛󰇜,
󰇛󰇜 󰇛󰇜󰇛󰇜
󰇛󰇜 󰇛󰇜
.
The edges are labeled as
󰇛󰇜
󰇛󰇜
󰇛󰇜 󰇛󰇜
󰇛󰇜 󰇛󰇜
󰇛󰇜
Then the edge labels are distinct. Hence in this case is a Root Square mean labeling of .
The labeling pattern is shown below.
Figure 2
Sub Case 1(b): If is odd then
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 7, No. 1; 2015
75
Define a function 󰇛󰇜󰇝󰇞 by
󰇛󰇜󰇛󰇜󰇛󰇜 ,
󰇛󰇜 󰇛󰇜󰇛󰇜
󰇛󰇜 󰇛󰇜 
.
The edges are labeled as
󰇛󰇜
󰇛󰇜 
󰇛󰇜 󰇛󰇜
󰇛󰇜 󰇛󰇜
󰇛󰇜
Then the edge labels are distinct. Hence in this case is a Root Square mean labeling of .
The labeling pattern is shown below.
Figure 3
Case 2: If the triangle starts from , then we have to consider two sub cases.
Sub case 2(a): If is even , then
Define a function 󰇛󰇜󰇝󰇞 by
󰇛󰇜 󰇛󰇜 󰇛󰇜󰇛󰇜 ,
󰇛󰇜 󰇛󰇜
󰇛󰇜 
.
The edges are labeled as
󰇛󰇜
󰇛󰇜 
󰇛󰇜 󰇛󰇜
󰇛󰇜 󰇛󰇜
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 7, No. 1; 2015
76
󰇛󰇜
Then the edge labels are distinct. Hence in this case is a Root Square mean labeling of  .
The labeling pattern is shown below.
Figure 4
Sub Case 2(b): If is odd
Define a function 󰇛󰇜󰇝󰇞 by
󰇛󰇜 󰇛󰇜 󰇛󰇜 ,
󰇛󰇜 󰇛󰇜
󰇛󰇜 
.
The edges are labeled as
󰇛󰇜
󰇛󰇜 
󰇛󰇜 󰇛󰇜
󰇛󰇜 󰇛󰇜
󰇛󰇜
Then the edge labels are distinct. Hence in this case is a Root Square mean labeling of .
The labeling pattern is shown below.
Figure 5
From all the above cases, we conclude that Alternate Double Triangular Snakes 󰇛󰇛󰇜󰇜 are Root Square
mean graphs.
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 7, No. 1; 2015
77
Theorem 2.8: Double Quadrilateral snake graph 󰇛󰇜 is a Root Square mean graphs.
Proof: Let be the path .To construct󰇛󰇜, join and  to four new vertices
and by the edges   and , for 
Define a function 󰇛󰇛󰇜󰇜󰇝󰇞 by
󰇛󰇜󰇛󰇜󰇛󰇜 ,
󰇛󰇜 󰇛󰇜
󰇛󰇜󰇛󰇜 ,
󰇛󰇜,
󰇛󰇜.
The edges are labeled as
󰇛󰇜󰇛󰇜
󰇛󰇜󰇛󰇜
󰇛󰇜,
󰇛󰇜 󰇛󰇜
󰇛󰇜 
,

Then the edge labels are distinct. Hence in this case is a Root Square mean labeling of .
Example 2.9: The Root Square mean labeling of 󰇛󰇜 is given below.
Figure 6
Theorem 2.10: Alternate Double Quadrilateral snake graphs 󰇛󰇛󰇜󰇜 are Root Square mean graphs.
Proof: Let be the Alternate Double Quadrilateral snake 󰇛󰇛󰇜󰇜 .Consider a path .Join
and  (Alternatively) with to four new vertices  and .Here we consider two different
cases.
Case 1: If the Double Quadrilateral starts from , then we consider two sub cases.
Sub Case 1(a): If is even then
Define a function 󰇛󰇜󰇝󰇞 by
󰇛󰇜󰇛󰇜
󰇛󰇜 󰇛󰇜
󰇛󰇜󰇛󰇜 .
The edges are labeled as
󰇛󰇜
󰇛󰇜
󰇛󰇜
󰇛󰇜
󰇛󰇜
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 7, No. 1; 2015
78
󰇛󰇜
󰇛󰇜
Then the edge labels are distinct. Hence in this case is a Root Square mean labeling of .
The labeling pattern is shown below.
Figure 7
Sub Case 1(b): If is odd then
Define a function 󰇛󰇜󰇝󰇞 by
󰇛󰇜󰇛󰇜󰇛󰇜 ,
󰇛󰇜 󰇛󰇜
󰇛󰇜󰇛󰇜 .
The edges are labeled as
󰇛󰇜
󰇛󰇜
󰇛󰇜
󰇛󰇜
󰇛󰇜
󰇛󰇜
󰇛󰇜
Then the edge labels are distinct. Hence in this case is a Root Square mean labeling of .
The labeling pattern is shown below.
Figure 8
Case 2: If the Double Quadrilateral starts from , then we have to consider two sub cases.
Sub case 2(a): If is even , then
Define a function 󰇛󰇜󰇝󰇞 by
󰇛󰇜 󰇛󰇜 󰇛󰇜󰇛󰇜 ,
󰇛󰇜 󰇛󰇜
󰇛󰇜 .
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 7, No. 1; 2015
79
The edges are labeled as
󰇛󰇜
󰇛󰇜 
󰇛󰇜
󰇛󰇜 
󰇛󰇜
󰇛󰇜
󰇛󰇜
Then the edge labels are distinct. Hence in this case is a Root Square mean labeling of .
The labeling pattern is shown below.
Figure 9
Sub Case 2(b): If is odd , then
Define a function 󰇛󰇜󰇝󰇞 by
󰇛󰇜 󰇛󰇜 󰇛󰇜
󰇛󰇜 󰇛󰇜
󰇛󰇜 .
The edges are labeled as
󰇛󰇜
󰇛󰇜 
󰇛󰇜
󰇛󰇜 
󰇛󰇜
󰇛󰇜
󰇛󰇜
Then the edge labels are distinct. Hence in this case is a Root Square mean labeling of .
The labeling pattern is shown below.
Figure 10
Theorem 2.11: Polygonal chain  are Root Square mean graphs for all and .
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 7, No. 1; 2015
80
Proof: In  , let  be the first cycle. The
second cycle is connected to the first cycle at the vertex  .
Let be the second cycle.In general the rth cycle is
connected to the (r-1)th cycle at the vertex .Let the rth cycle be
󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜
󰇛󰇜.The figure of the rth cycle is given below.
Figure 11
Let the graph has cycles . Define a function 󰇛󰇜󰇝󰇞 by
󰇛󰇜 , 󰇛󰇜. Then the label of the edges is given below.󰇛󰇜
 , 󰇛󰇜, 󰇛󰇜󰇛󰇜󰇛󰇜,
󰇛󰇜󰇛󰇜󰇛󰇜.
Hence the graph  has distinct edge labels, hence  is a Root Square mean graph.
Example 2.12: Root Square mean labeling of  chain is given below.
Figure 12
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 7, No. 1; 2015
81
Reference
David Raj, C., Jayasekaran, C., & Sandhya, S. S. (2013). Harmonic Mean Labeling on Double Quadrilateral
Snake Graph. Global Journal of Theoretical and Applied Mathematics Sciences, 3(2), 67-72.
Gallian, J. A. (2010). A dynamic Survey of graph labeling. The electronic Journal of Combinatories, 17#DS6.
Harary, F. (1988). Graph Theory, Narosa Publishing House Reading, New Delhi.
Jayasekaran, C., Sandhya, S. S., & David Raj, C. (2013). Harmonic Mean Labeling on Double Triangular Snakes.
International Journal of Mathematics Research, 5(2), 251-256.
Sandhya, S. S., & Anusa, S. Mean Labeling on Double Triangular and Double Quadrilateral Snake Graphs.
Proceedings of the Kanyakumari Academy of Arts and Sciences, ISBN 978-93-81658-10-9 Volume-3.
Sandhya, S. S., Somasundaram, S., & Anusa, S. Root Square Mean Labeling Of Graphs. International Journal of
Contemporary Mathematical Sciences.
Sandhya, S. S., Somasundaram, S., & Anusa, S. Some Results On Root Square Mean Graphs. Journal of
Scientific Research.
Sandhya, S. S., Somasundaram, S., & Ponraj, R. (2012). Some More Results on Harmonic Mean Graphs.
Journal of Mathematics Research, 4(1), 2012. http://dx.doi.org/10.5539/jmr.v4n1p21
Somasundaram, S., & Ponraj, R. (2003). Mean labeling of graphs. National Academy of Science Letters, 26,
210-213.
Somasundaram, S., & Ponraj, R. (2003). Some results on mean graphs. Pure and Applied Mathematika Sciences,
58, 29-35.
Copyrights
Copyright for this article is retained by the author(s), with first publication rights granted to the journal.
This is an open-access article distributed under the terms and conditions of the Creative Commons Attribution
license (http://creativecommons.org/licenses/by/3.0/).
... These were defined by Rosa [1]. DEFINITION 2 [1], [3], [12] : A Triangular Snake Tn is obtained from a path u1, u2, u3, . . ., un by joining ui and ui+1 to a new vertex vi for 1 ≤ i ≤ n -1. ...
... DEFINITION 3 [1], [3], [12]: A Double Triangular Snake D(Tn) consists of two triangular snakes that have a common path. DEFINITION 4 [1], [3], [12]: An Alternate Triangular Snake ATn is obtained from a path u1, u2, u3, . . ...
... DEFINITION 3 [1], [3], [12]: A Double Triangular Snake D(Tn) consists of two triangular snakes that have a common path. DEFINITION 4 [1], [3], [12]: An Alternate Triangular Snake ATn is obtained from a path u1, u2, u3, . . ., un by joining ui and ui+1 (alternatively) to a new vertex vi. ...
Article
Full-text available
In this paper, I have discussed the total chromatic number of Snake graphs viz., like Triangular Snake and its sub classes of graphs, Quadrilateral Snake graphs and its sub classes of graphs, Ladder Graph and Polygonal Chain. The total chromatic number of a graph G is defined as the assignment of minimum number of colors, to color the vertices, V(G) and the edges, E(G) of a graph in such a way that no two adjacent vertices nor no two adjacent edges receive same color, and no incident vertex and edge receive the same color.
... A graph that accepts a mean labeling is known as mean graph. It was extended to root square mean labeling [7], cube root cube mean labeling [3], etc. Radhika and Vijayan [6] defined a new labeling namely super cube root cube mean labeling. Let f : V(G) → { 1, 2, 3, . . . ...
Article
Full-text available
Let G be a graph with |V (G)| = p and |E (G)| = q and f : V (G) → {k, k+1, k+2,..., p+q+k − 1 } be an one-to-one function. The induced edge labeling f ∗, for a vertex labeling f is defined by f ∗(e) = for all e = uv ∈ E(G) is bijective. If f(V (G)) ∪ {f ∗(e) : e ∈ E(G)} = {k, k+1, k+2,..., p+q+k − 1}, then f is known as a k-super cube root cube mean labeling. If such labeling exists, then G is a k-super cube root cube mean graph. In this paper, I prove that Tn ʘ K1, A(Tn) ʘ K1, A(Tn) ʘ 2K1, A(Qn) ʘ K1, Pn ʘ K1,2 and Pn ʘ K1,3 are k-super cube root cube mean graphs.
... For detailed study of graph labeling, refer to J. A. Gallian [2]. Many researchers in practice contributed various types of labeling like k-super mean labeling [3,7], root square mean labeling [6], k-super root square mean labeling [1], cube root cube mean labeling [4], super cube root cube mean labeling [5], etc. In this paper, I have added another type of graph labeling, i.e., k-super cube root cube mean labeling. ...
Article
Full-text available
Consider a graph G with |V (G)| = p and |E(G)| = q and let f : V (G) → {k, k + 1, k + 2, . . . p + q + k − 1}} be an injective function. The induced edge labeling f ∗ for a vertex labeling f is defined by f ∗ (e) = for all e = uv ∈ E(G) is bijective. If f(V (G)) ∪ {f ∗ (e) : e ∈ E(G)} = {k, k + 1, k + 2, . . . , p + q + k − 1}, then f is called a k-super cube root cube mean labeling. If such labeling exists, then G is a k-super cube root cube mean graph. In this paper, I introduce k-super cube root cube mean labeling and prove the existence of this labeling to the graphs viz., triangular snake graph Tn, double triangular snake graph D(Tn), Quadrilateral snake graph Qn, double quadrilateral snake graph D(Qn), alternate triangular snake graph A(Tn), alternate double triangular snake graph AD(Tn), alternate quadrilateral snake graph A(Qn), & alternate double quadrilateral snake graph AD(Qn).
... For all detailed survey of graph labeling we refer to Galian [1]. For all other standard terminology and notations we follow Harary [2].The concept of Root Square Mean labeling was introduced by S.S.Sandhya,S.Somasundaram and S. Anusa in [3] and the Root square mean labeling of some standard graphs was proved in [4] to [9]. In this paper we prove that , Flag , Balloonof Triangular snake, Balloon of Quadrilateral snake, (P n K 1 ) K 1 , (P n K 1 ) K 1,2 and (P n K 1 ) K 1,3 are Root Square Mean graphs. ...
Conference Paper
Let f:V(G) → {1,2,….....q+1} be an injective function. For a vertex labeling f, the induced edge labeling f (e=uv) is defined by, f(e=uv)=[ f(u)2+f(v)22 ] or [ f(u)2+f(v)22 ], then the edge labels are distinct and are from {1,2,….. q}. Then f is called a Root Square Mean labeling of G. The concept of Root square mean labeling was introduced by S.S.Sandhya, S.Somasundaram and S.Anusa. In this paper we investigate some results on Root Square Mean labelingof graphs. Also find out Super root square mean labelingof some special graphs.
... The concept of Mean labeling has been introduced by Somasundaram and Ponraj [5]. Root Square Mean Labeling of Graphs has been introduced by Sandhya, Somasundaram and Anusa [6]. Root Cube Mean Labeling of Graphs has been introduced by Gowri and Vembarasi [3]. ...
... R.Varatharajan, et.al [11] introduced the notion of divisor cordial labeling. S.S.Sandhya et.al [10] has discussed the root square mean graphs of triangular snake and double triangular snake. S.N.Daoud et.al discussed edge odd graceful labeling of fan graph and half gear graph in [4]. ...
Article
Full-text available
A graph with vertices and edges is called a Root Square Mean graph if it is possible to label the vertices with distinct elements from in such a way that when each edge is labeled with or , then the resulting edge labels are distinct. In this case is called a Root Square Mean labeling of . The concept of Root Square Mean labeling was introduced by (S. S. Sandhya, S. Somasundaram and S. Anusa). We investigated the Root Square Mean labeling of several standard graphs such as Path, Cycle, Comb, Ladder, Triangular snake, Quadrilateral snake etc., In this paper, we investigate the Root Square Mean labeling for Double Triangular snake, Alternate Double Triangular snake, Double Quadrilateral snake, Alternate Double Quadrilateral snake, and Polygonal chain.
Article
Full-text available
Let G be a graph with q edges. A labelling f of G is said to be root square mean labelling if f : V ( G )U E ( G )→{1,2,…, q +1} such that when each edge e = uv labelled with f ( e )=[ f ( u ) ² + f ( v ) ² /2] or f ( e )=[ f ( u ) ² + f ( v ) ² /2] then the resulting edge labels are distinct. A graph G is called a root square mean graph if G can be labelled by a root square mean labelling. In this paper we determine a root mean square labelling of two graphs obtained from path, which are corona product of ladder and complete graph with order 1, and a graph obtained from triangular snake by join one vertex with degree 2 in each triangle to a new vertex. The method of labelling construction is we need to do labeling to the vertices of the graph with label 1, 2, 3, …, q+ 1. The labels of the vertices are not necessarily different. The next step is we need to do labeling to the edges with the certain formula by using the vertex labeling. The edge labels must be different. By the labelling we construct, we proof that the two graphs are root square mean graphs.
Article
Full-text available
In this paper we investigate Harmonic mean Labeling behaviour of Double Quadrilateral snake and Alternate Double Quadrilateral snake graphs.
Article
Full-text available
A graph G=(V,E) with p vertices and q edges is called a harmonic 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(uv)=2f(u)f(v) f(u)+f(v) or 2f(u)f(v) f(u)+f(v) then the edge labels are distinct. In this case f is called harmonic mean labeling of G. The concept of Harmonic mean labeling was introduced in [the authors, “Harmonic mean labelings of graphs” (to appear)]. In [loc. cit.] and in [Int. J. Contemp. Math. Sci. 7, No. 1–4, 197–208 (2012; Zbl 1251.05128)] we investigate the harmonic mean labeling of several standard graphs such as path, cycle comb, ladder, triangular snakes, quadrilateral snakes etc. In the present paper, we investigate the harmonic mean labeling for a polygonal chain, square of the path and dragon. Also we enumerate all harmonic mean graph of order ≤5.
Article
Full-text available
A vertex labeling of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy a label depending on the vertex labels f(x) and f(y). The two best known labeling methods are called graceful and harmonious labelings. A function f is called a graceful labeling of a graph G with q edges if f is an injection from the vertices of G to the set {0, 1, . . . , q} such that, when each edge xy is assigned the label |f(x) - f(y)|, the resulting edge labels are distinct. A function f is called a harmonious labeling of a graph G with q edges if it is an injection from the vertices of G to the group of integers modulo q such that when each edge xy is assigned the label f(x)+f(y) (mod q), the resulting edge labels are distinct. When G is a tree, exactly one label may be used on two vertices. Over the past three decades many variations of graceful and harmonious labelings have evolved and about 300 papers have been written on the subject of graph labeling....
Article
We introduce a new type of labeling known as mean labeling. We prove that the following are mean graphs: the path P n , the cycle C n , the complete graph K n for n≤3, the triangular snake and some more special graphs. We also prove that the complete graph K n and the complete bipartite graph K 1,n for n>3 are not mean graphs. From the text: A graph G with p vertices and q edges is called a mean graph if it is possible to label the vertices x∈V with distinct elements f(x) from 0,1,⋯,q in such a way that when each edge e=uv is labelled with (f(u)+f(v))/2 if f(u)+f(v) is even and (f(u)+f(v)+1)/2 if f(u)+f(v) is odd, then the resulting edge labels are distinct. f is called a mean labeling of G.
Harmonic Mean Labeling on Double Triangular Snakes
  • C Jayasekaran
  • S S Sandhya
  • C David Raj
Jayasekaran, C., Sandhya, S. S., & David Raj, C. (2013). Harmonic Mean Labeling on Double Triangular Snakes. International Journal of Mathematics Research, 5(2), 251-256.
Mean Labeling on Double Triangular and Double Quadrilateral Snake Graphs
  • S S Sandhya
  • S Anusa
Sandhya, S. S., & Anusa, S. Mean Labeling on Double Triangular and Double Quadrilateral Snake Graphs. Proceedings of the Kanyakumari Academy of Arts and Sciences, ISBN 978-93-81658-10-9 Volume-3.
Graph Theory, Narosa Publishing House Reading
  • F Harary
Harary, F. (1988). Graph Theory, Narosa Publishing House Reading, New Delhi.
Root Square Mean Labeling Of Graphs
  • S S Sandhya
  • S Somasundaram
  • S Anusa
Sandhya, S. S., Somasundaram, S., & Anusa, S. Root Square Mean Labeling Of Graphs. International Journal of Contemporary Mathematical Sciences.