Authors:
P. Jagadeeswari,K. Manimekalai,K. Bhuvaneswari,DOI NO:
https://doi.org/10.26782/jmcms.spl.2019.08.00074Keywords:
Square difference graph,duplication,switching of vertex,2-tuple graph,Abstract
In this paper, we prove that the duplication of each vertex of a path by an edge, the duplication of a pendant vertex by an edge of CnʘK1, 2-tuple graph of K1,n , the switching of a pendant vertex in path admit square difference labeling(SDL).Refference:
I. Frank Harary, Graph
II. Gallian. J.A, A dynamic survey of graph labeling, The electronics journal of
Combinatories, 17 (2010) #DS6.
III. Rosa. A, On certain valuation of graph theory of graphs (Rome, July 1966),
Golden and Breach, N.Y and Paris (
IV. Shiama. J, “Square difference labeling for certain graph”, International Journal
of Computer Applications (0975
V. Shiama. J, “Square difference labeling of some path, fan and gear graphs”,
International Journal of
3, March 2013.
VI. Sugumaran. A and V. Mohan, “Difference Cordial Labeling of some special
graphs and related to fan graphs”, International journal for research in
Engineering Application and Management, ISS
March 2019.
VII. Vihol. P.L and P.H. Shah, “Difference cordial Labeling of 2
Some graphs”, International journal of Mathematics and its Applications, Vol
4, Issue 2-A(2016), 111
Advancement in Engineering, Science & Technology
No.-2, August (2019) pp
631
+1)
1
g*(ei) g*(ej), ei ejE(G).
Square Difference Labeling for 𝑇𝐾,
some special graphs of cycle, path and tree
quare labeling.
theory, Narosa Publishing House, 2001.
, , 1967), 349355.
, 0975-08887), 44(4) (2012).
, Scientific and Engineering Research, Volume 4, Issue
ISSN: 2454 – 9150, vol 4, Issue 12,
2–tuple graphs of
111-119.