On Real Roots of Complement Degree Polynomial of Graphs.
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...
Main Authors: | K Safeera, V Anil Kumar |
---|---|
Format: | Article |
Language: | English |
Published: |
Accademia Piceno Aprutina dei Velati
2023-06-01
|
Series: | Ratio Mathematica |
Subjects: | |
Online Access: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/795 |
Similar Items
-
Stability of Complement Degree Polynomial of Graphs
by: Safeera K, et al.
Published: (2023-03-01) -
Degree sum adjacency polynomial of standard graphs and graph operations
by: S S Shinde, et al.
Published: (2022-03-01) -
The degree and the order of polynomials in the ring R [F1A]
by: Ronnason Chinram
Published: (2007-11-01) -
On the Decomposability of the Linear Combinations of Euler Polynomials with Odd Degrees
by: Ákos Pintér, et al.
Published: (2019-05-01) -
On the Roots of the Modified Orbit Polynomial of a Graph
by: Modjtaba Ghorbani, et al.
Published: (2021-05-01)