In this paper we give optimal super vertex sum labeling scheme for super subdivision of bi-star, path union of spider and algorithm to construct super vertex sum labeling of super subdivision of Caterpillar.

Citation details of the article

Journal: International Journal of Applied Mathematics
Journal ISSN (Print): ISSN 1311-1728
Journal ISSN (Electronic): ISSN 1314-8060
Volume: 31
Issue: 4
Year: 2018

DOI: 10.12732/ijam.v31i4.9

Download Section

Download the full text of article from here.

You will need Adobe Acrobat reader. For more information and free download of the reader, please follow this link.


  1. [1] P.T. Chung and S.M. Lee, On the super edge-graceful spiders of even orders, J. Combinatorial Math. Combinatorial Computing, 64 (2008), 3-17.
  2. [2] J.A. Gallian, A dynamic survey of graph labeling, DS6 The Electronics J. Combinatorics, Version 20 (2017).
  3. [3] F. Harary, Graph Theory, AddisonWesley, Reading, Massachusetts (1969).
  4. [4] F. Harary, Sum graphs and Difference graphs, Congressus Numerantium, 72 (1990), 101-108.
  5. [5] G.R. Joseph and J.V. Kureethara, Super vertex sum labeling of graphs, Int. J. Pure Appl. Math., 118, No 10 (2018), 293-300; DOI: 10.12732/ij-pam.v118i10.70.
  6. [6] G. Sethuraman and P. Selvaraju, Gracefulness of arbitrary super subdivisions of graphs, Indian J. Pure Appl. Math., 32, No 7 (2001), 1059-1064.
  7. [7] S.K. Vaidya, N.A. Dani, K.K. Kanani and P.L. Vihol, Cordial and 3-equitable labeling for some star related graphs, Int. Mathematical Forum, 4, No 31 (2009), 1543-1553.