Alpha labeling of splitting graph of a gutman tree

Citations of this article
Mendeley users who have this article in their library.
Get full text


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.




Natarajan, C., & Sathiamoorthy, G. (2019). Alpha labeling of splitting graph of a gutman tree. International Journal of Innovative Technology and Exploring Engineering, 8(10), 1475–1477.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free