Abstract
A Triangular snake Tn is obtained from a path u1u2 …un by joining ui and ui+1 to a new vertex wi for 1≤i≤n−1. A Central graph of Triangular snake C(Tn) is obtained by subdividing each edge of Tn exactly once and joining all the non adjacent vertices of Tn. In this paper the ways to construct square sum, square difference, Root Mean square, strongly Multiplicative, Even Mean and Odd Mean labeling for Triangular Snake and Central graph of Triangular Snake graphs are reported.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
