Alpha labeling of splitting graph of a gutman Tree
Natarajan C1, Sathiamoorthy G2
1Natarajan C, Department of Mathematics, SASH, SASTRA Deemed University, Tamil Nadu, India.
2Sathiamoorthy G, Department of Mathematics, SASH, SASTRA Deemed University, Tamil Nadu, India.
Manuscript received on 02 July 2019 | Revised Manuscript received on 09 July 2019 | Manuscript published on 30 August 2019 | PP: 1475-1477 | Volume-8 Issue-10, August 2019 | Retrieval Number: J10190881019/19©BEIESP | DOI: 10.35940/ijitee.A1019.0881019
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The splitting graph S'(G) of graph G results by introducing a new point a’ with respect to each point a of G such that N(a) equals to N(a’) where N(a) and N(a’) are the neighborhood sets of a and a’ respectively. The Gutman tree is also known as benzenoid tree and caterpillar tree. In this paper, it is proved that a splitting graph of a Gutman tree satisfies an alpha labeling.
Keywords: Alpha labeling, splitting graph, Gutman tree
Scope of the Article: Graph Algorithms and Graph Drawing