Square Sum Labelling for Lobster and Fan Graph
MLA Style: S.Uma Maheswari, S.Saranyadevi. "Square Sum Labelling for Lobster and Fan Graph" International Journal of Mathematics Trends and Technology 67.9 (2021):146-150.
APA Style: S.Uma Maheswari, S.Saranyadevi(2021). Square Sum Labelling for Lobster and Fan Graph International Journal of Mathematics Trends and Technology, 67(9), 146-150.
Abstract
Let G = (V, E) be a (p,q)-graph and let f: V(G)->{0,1,2,..., p-1} be a bijection. We define f* on E(G) by f * (uv) = [f(u)]2 + f(v)]2. If f* is injective on E(G), then f is called a squre sum labelling. The graph G is said to be a square sum graph if G admits a square sum labelling.
Reference
[1] V.Ajitha, S.Arumugam and K.A.Germina, On square sum graphs AKCE J.Graphs, Combin; 6(2006) 1-10.
[2] M. Akram, Middle-East Journal of Scientific Research 11, 1641 (2012)
[3] Frank Harrary, Graph theory, Narosa Publishing House- (2001).
[4] J A Gallian, A dynamic survey of graph labelling, The Electronics Journal of Combinatories,17(2017) # DS6.
[5] K.A.Germina on Square sum labelling, International Journal of Advanced Engineering and Global Technology(2309-4893) 2(1) 2014.
[6] A. Rosa On certain valuations of the vertices of a graph, in theory of graphs. International Symposium Rome. 1966; 349–355. Gordon and Breach, New York, NY, USA, (1967).
Keywords : Square Sum Labelling, Labelling of Graph, the lobster, full n-ary tree, and the amalgamation of a fan and a star graph.