Eccentric Adjacent Vertex Sum Polynomial of
Wheel Related Graphs

Sowmya.S

doi:https://doi.org/10.14445/22315373/IJMTT-V65I5P504

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 65 | Issue 5 | Year 2019 | Article Id. IJMTT-V65I5P504 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I5P504

Eccentric Adjacent Vertex Sum Polynomial of Wheel Related Graphs

Sowmya.S

Abstract

Let G = (V(G), E(G)) be a graph. The eccentric adjacent vertex sum polynomial of graph G is defined as EA(G,x) =∑ki=0 ε G(vi)xδG(vi) where the eccentricity ε G(vi) is the largest distance from vi to any other vertices of G and δG(vi) = ∑vjεN(vi) dG(Vj), is the sum of degrees of the neighboring vertices of vi ε G. In this paper, I discussed the eccentric adjacent vertex sum polynomial of some wheel related graphs.

Keywords

eccentric adjacent vertex sum polynomial, eccentricity, wheel.

References

[1] Gross, J.L. and Yellen, J., Handbook of Graph Theory. CRC Press, Boca Raton, 2004.
[2] Ponraj, R., Sathish Narayanan, S. and Kala, R., A Note on Difference Cordial Graphs. Palestine Journal of Mathematics, 4, 189-197, 2015.
[3] Udayan M. Prajapati, Nittal B. Patel, Edge Product Cordial Labeling of Some Cycle Related Graphs, Open Journal of Discrete Mathematics, 6, 268-278, 2016.
[4] Vaidya, S.K. and Barasara, C.M., Edge Product Cordial Labeling of Graphs, Journal of Mathematical and computational Science, 2, 1436-1450, 2012.
[5] Vaidya, S.K. and Prajapati, U.M., Prime Labeling in the Context of Duplication of Graph Elements, International Journal of Mathematics and Soft Computing , 3, 13-20, 2013.

Citation :

Sowmya.S, "Eccentric Adjacent Vertex Sum Polynomial of Wheel Related Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 5, pp. 27-31, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I5P504