E. Sukumaran
Abstract
Let G be a graph. The adjacent vertex sum polynomial is defined as S(G, x) = (G) i 0 ∑ n∆(G) – i. xα∆(G) – i where ∆(G) = max {deg v / v ∈ G}, n∆(G) – i is the sum of the number of adjacent vertices of all the vertices of degree ∆(G) – i and α∆(G) – i is the sum of the degree of adjacent vertices of all the vertices of degree ∆(G) – i. In this paper I find the
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let G be a graph. The adjacent vertex sum polynomial is defined as S(G, x) = (G) i 0 ∑ n∆(G) – i. xα∆(G) – i where ∆(G) = max {deg v / v ∈ G}, n∆(G) – i is the sum of the number of adjacent vertices of all the vertices of degree ∆(G) – i and α∆(G) – i is the sum of the degree of adjacent vertices of all the vertices of degree ∆(G) – i. In this paper I find the
Key concepts: Combinatorics, Mathematics, Neighbourhood (mathematics), Graph power, Wheel graph, Vertex (graph theory), Bound graph, Distance-regular graph