Square graceful graphs

T Tharmaraj, P. B Sarasija



A ( p, q) graph G(V, E) is said to be a square graceful graph if there exists an injection f :V(G)---{0,1,2,3,..., q2 } such that the induced mapping f p : E(G) --- {1, 4, 9,..., q2} defined by f (uv)=| f (u) f (v)| p = ? is a bijection.


The function f is called a square labeling of G . In this paper, we prove that the star n K 1, , bistar m n B , , the graph obtained by the subdivision of the edges of the star K1,n , the graph obtained by the subdivision of the central edge of the bistar Bm,n , the generalised crown n C K 3 1, ? , graph 1 P nK m ? (n ? 2) , the comb 1 P K n? , graph ( , ) m n P S , (3, t) kite graph (t ? 2) and the path Pn are square graceful graphs.

Full Text:



F.Harary, Graph Theory,Addison-Wesley,Reading,Massachusetts,1972.

J.A.Gallian,A dynamic survey of graph labeling,The Electronic journal of combinatorics,

(2002),# DS6,1-144.

K.Murugan and A.Subramanian American.Jr.of.Mathematics and Sciences ,

(January 2012) ,Vol.1,No.1

Selvam Avadayappan , R.Vasuki , International J.Math. combin. Vol.2 (2010), 68-80

Diari Indriaati , Journal Mathematika and Sains,(2011),Vol.16,No.3.


  • There are currently no refbacks.

Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.