The graph SSG(2) is odd graceful and odd harmonious
by J. Jeba Jesintha; K. Ezhilarasi Hilda Stanley
International Journal of Computer Aided Engineering and Technology (IJCAET), Vol. 14, No. 1, 2021

Abstract: A subdivided shell graph is obtained by subdividing the edges in the path of the shell graph. Let G₁, G₂, G₃, ..., G_n be 'n' subdivided shell graphs of any order. The graph SSG(n) is obtained by adding an edge to apexes of G_i and G_i+1, i = 1, 2, ..., (n−1). The graph SSG(n) is called a path union of 'n' subdivided shell graphs of any order. In this paper we prove that the subdivided shell graph is odd harmonious. We also prove that SSG(n) is odd graceful and odd harmonious when n = 2.

Online publication date: Mon, 07-Dec-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Aided Engineering and Technology (IJCAET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com