On Real Roots of Complement Degree Polynomial of Graphs.

K Safeera, V Anil Kumar

Abstract


Let  G=(V,E) be a simple undirected graph of order  xi n and let CD(G,i) be the set of vertices of degree i in complement graph  and let Cdi(G)=|CD(G,i)|. Then complement degree polynomial of G is defined as CD[G,x]=$\sum_{i=\delta(\overline{G})}^{\Delta(\overline{G})}$Cdi(G)xi. In this paper, focus on real roots of complement degree polynomial of graphs and bounds of roots of complement degree polynomial of graphs.


Keywords


complement degree polynomial , cd-roots.

Full Text:

PDF

References


Safeera K and Anil Kumar V, Complement Degree Polynomial of Graphs, South East Asian Journal of Mathematics and Mathematical Sciences(communicated).

Safeera K and Anil Kumar V, Complement Degree polynomials of some graph operations, Palestine Journal of Mathematics(communicated).

Safeera K and Anil Kumar V, Stability of Complement Degree Polynomial of Graphs, South East Asian Journal of Mathematics and Mathematical Sciences(communicated).

Shiki.M, A study on common neighbor polynomial of graphs, Ph.D Thesis, 2019.

Haray F, Graph theory, Adison-Wesley.

A.M.Anto and P.Paul Hawkins, Vertex polynomial of graphs with new results, Global journal of pure and applied Mathematics, Volume 15, Number 4 2019, 469-475.

V.Jeba Rani, S. Sundar Raj and T. Shyla Isaac Mary, Vertex polynomial of Ladder graphs, Infokara Research, Volume 8, 2019, 169-179.

Victor V. Prasolov, Polynomials, Springer Science and Business Media, 2009.




DOI: http://dx.doi.org/10.23755/rm.v47i0.795

Refbacks

  • There are currently no refbacks.


Copyright (c) 2023 Safeera K, Anil Kumar V

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.