-labeling of supersubdivided connected graph plus an edge
References
- RosaA., On certain valuations of the vertices of a graph Theory of Graphs Rome, 1966 International Symposium1967Gordon and Breach, NY, Dunod Paris349–355
- GolombS.W., How to number a graphReadR.C.Graph Theory and computing1972Academic PressNew York23–37
- El-ZanatiS.I.Vanden EyndenC.PuninN., On the cyclic decomposition of complete graphs into bipartite graphs Australas. J. Combin. 242001 209–219
- FrončekD., Bi-cyclic decompositions of complete graphs into spanning trees Discrete Math. 3072007 1317–1322
- FrončekD.KubesaM., Factorizations of complete graphs into spanning trees Congr. Numer. 1542002 125–134
- PasottiA., On d-graceful labelings Ars Combin. 1112013 207–223
- BlincoA.El-ZanatiS.I.Vanden EyndenC., On the cyclic decomposition of complete graphs into almost-bipartite graphs Discrete Math. 2842004 71–81
- BlairG.W.BowmanD.L.El-ZanatiS.I.HaldS.M.PribanM.K.SebestaK.A., On cyclic C2m+e-designs Ars Combin. 932009 289–304
- BungeR.C.El-ZanatiS.I.O’HanlonW.Vanden EyndenC., On γ-labeling of the almost-bipartite graph Pm+e Ars Combin. 1072012 65–80
- El-ZanatiS.I.O’HanlonW.A.SpicerE.R., On γ-labeling of the almost-bipartite graph Km,n+e East-West J. Math. 10 2 2008 133–139
- El-ZanatiS.I.Vanden EyndenC., On Rosa-type labelings and cyclic graph decompositions Math. Slovaca 59 1 2009 1–18
- GallianJ.A., A dynamic survey of graph labeling Electron. J. Combin. 202017 #DS6
- SethuramanG.SelvarajuP., Gracefuness of arbitrary supersubdivisions of graphs Indian J. Pure Appl. Math. 32 7 2001 1059–1064
- G. Sethuraman, M. Sujasree, Generating γ-labeled graphs from any tree with at least three vertices, Indian J. Pure Appl. Math. (submitted for publication).
- SethuramanG.SelvarajuP., Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs Discrete Math. 2602003 137–149