1 publication
-
Published Subscription
An Atlas of Vertex Degree Polynomials of Graphs of Order at Most SixBy Hanan Ahmed, Anwar Alwardi, Ruby Salestina M.
Abstract: AbstractThe vertex degree polynomial of a graph G of order n is defined as V D(G, x) = åuv∈E(G) d(u)xd(v) where d(u) is the degree of the vertex u [5]. We call the roots of a vertex degree polynomial of a graph the vertex degree roots of that graph. In this article, we compute the vertex degree polynomial of all graphs of order less than or equal six and their …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 7, Issue 3, 2020 · pp. 7–14 Read article →