Volume 34 | Number 1 | Year 2016 | Article Id. IJMTT-V34P505 | DOI : https://doi.org/10.14445/22315373/IJMTT-V34P505
A difference labeling of a graph G is realized by assigning distinct integer values to its vertices and then associating with each edge uv the absolute difference of those values assigned to its end vertices. A decomposition of labeled graph into parts, each part containing the edge having a common- weight is called a common – weight decomposition. In this paper we investigate the existence of difference labeling of , Braid graph, Mongolian Ger and Alternative Quadrilateral Snake.
[1]. G.S. Bloom, and S. Ruiz. “Decompositions into Linear Forests and Difference Labelings of Graphs”, Discrete Applied Mathematics, vol. 49, pp. 61-75, 1994.
[2]. J.A. Bondy, and U.S.R. Murthy. “Graph Theory and Applications” (North-Holland). New York 1976.
[3]. J.A. Gallian. “A Dynamic Survey Of Graph Labeling”, The Electronic Journal of Combinations 16 # DS6, 2009.
[4]. F. Harary. “Graph Theory Addition” Wesley, Reaching Mass 1969.
[5]. N. Hartsfield, and G. Ringel. “Pearls in Graph Theory”, Academic press 1994.
[6]. S. Meena, and S. Arumugam. “Studies of Graph Theory Factorizations and Decompositions of Graphs”, Ph.D Thesis Manonmaniam Sundaranar University, 1999.
[7]. K. Vaithilingam, and S. Meena. “Labelings of Graph”, Ph.D Thesis Thiruvalluvar University, 2014.
[8]. P. Jeyanthi and T. Saratha Devi “On Edge Pair Sum Labeling of Graphs”, International Journal of Mathematics Trends and Technology, vol. 7, No. 2, March-2014.
[9]. Manisha M. Archarya. “Even Vertex Graceful Labeling for Two Graphs” International Journal of Mathematics Trends and Technology, vol. 9, No. 3, May-2014.
S. Meena, G. Amuda, "Common Weight Decompositions of Some Classes of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 34, no. 1, pp. 19-22, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V34P505