On the gracefulness of m-super subdivision of graphs

References

• M. Alaeiyan, M.R. Farahani. The 1-2-3-edge labeling and vertex Colors. International Journal of Applied Mathematics and Machine Learning. 4(2), 2016, 119-133. http://www.scientificadvances.co.in/artical/17/192 doi: 10.18642/ijamml_7100121608
   Google Scholar
• B. Ambili, G.S. Singh, Graceful labelings Graceful labeling of arbitrary strong supersubdivisions of graphs, Graph Theory Notes N. Y., 61 (2011) 31-36. http://gtn.kazlow.info/GTN61.pdf
   Google Scholar
• C. Barrientos, Graceful arbitrary supersubdivisions of graphs, Indian Journal of Appl. Math., 38 (2007) 445-450.
   Web of Science ®Google Scholar
• C. Barrientos, M. E. Abdel-Aal, S. Minion, D. Williams, The mean labeling of some crowns, J. Algorithms and Comput., 45 (2014) 43-54.
   Google Scholar
• M.R. Farahani, S.H. Hosseini. The 1-2-3-edge labeling and vertex coloring of complete graph Kn with a modified algorithm. Algebras, Groups and Geometries. 31(2), (2014), 183-199.
   Google Scholar
• M.R. Farahani. On The 1-2-3-Edge Weighting and Vertex Coloring of Complete Graph. Int. J. Computational Sciences & Applications. 3(3), (2013), 19-23. DOI:10.5121/ijcsa.2013.3302
   Google Scholar
• M.R. Farahani. Vertax-Coloring and Edge-Weighting of complete graphs. J. Appl. Math. & Informatics. 32(1-2), (2014), 1-6. DOI:10.14317/jami.2014.001
   Google Scholar
• J.A. Gallian, A Dynamic Survey of Graph labeling, The Electronic Journal of Combinatorics, DS6, (2019) 1-535.
   Google Scholar
• S.W. Golomb, How to number a graph, Graph theory and computing Inc: Read R.C. (ed.) Academic Press, New York, (1972), 23-37.
   Google Scholar
• K. Kathiresan, K.S. Amutha, Arbitrary supersubdivisions of stars are graceful. Indian J Pure Appl Math., 35 (2004), 81-84.
   Web of Science ®Google Scholar
• K. Kathiresan, R. Sumathi, Solution to an open problem in gracefulness of arbitrary supersubdivisions of graphs, Util. Math., 84 (2011) 333-338.
   Web of Science ®Google Scholar
• A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs, International Symposium, Rome, July Gordon and Breach, N.Y. and Dunod Paris, (1966), 105-110.
   Google Scholar
• C. Sekar, V. Ramachandren, Graceful labelling of arbitrary supersubdivision of disconnected graph, Ultra Scientist, 25(2)A (2013) 315-318.
   Google Scholar
• G. Sethuraman, P. Selvaraju, Gracefulness of arbitrary supersubdivisions of graphs, Indian J. Pure Appl. Math., 32 (2001), 1059-1064.
   Web of Science ®Google Scholar
• G. Sethuraman, P. Selvaraju, Decompositions of complete graphs and complete bipartite graphs into isomorphic Super subdivision graphs, Discrete Maths, 260 (2003), 137-149. DOI:10.1016/S0012-365X(02)00455-7
   Web of Science ®Google Scholar
• S. Sudha, V. Kanniga, Arbitrary supersubdivision of helms, centipedes and ladder graphs are graceful, Math, Sci. Internat. Research J., 1(3), 2015, 860-863.
   Google Scholar
• S.K. Vaidya, K. Kanani, Some new results on cordial labeling in the context of arbitrary supersubdivision of graph, Applied Math. Sci., 4(47), 2010, 2323-2329.
   Google Scholar
• S.K. Vaidya, N.A. Dani, Cordial labeling and arbitrary super subdivision of some graphs, Inter. J. Information Sci. Comput. Math., 2(1), 2010, 51-60.
   Google Scholar
• H. Yang, M.A. Rashid, S. Ahmad, M.K. Siddiqui, M. F. Hanif. Cycle super magic labeling of pumpkin, octagonal and hexagonal graphs. Journal of Discrete Mathematical Sciences and Cryptography. 22(7), 1165-1176, (2019). DOI: 10.1080/09720529.2019.1698800
   Web of Science ®Google Scholar
• L. Yan, Y. Li, X. Zhang, M. Saqlain, S. Zafar, M.R. Farahani. 3-total edge product cordial labeling of some new classes of graphs. Journal of Information & Optimization Sciences, 39(3) 2018, 705–724. DOI:10.1080/02522667.2017.1417727
   Web of Science ®Google Scholar
• X. Zhang, F.A. Shah, Y. Li, L. Yan, A.Q. Baig, M.R. Farahani. A family of fifth-order convergent methods for solving nonlinear equations using variational iteration technique. Journal of Information and Optimization Sciences, 39(3), 2018, 673–694. DOI:10.1080/02522667.2018.1443628
   Web of Science ®Google Scholar