Results on Graph Energy
G Sangeetha, J Kavitha
Abstract
Open-access reader
G Sangeetha, J Kavitha
Abstract
Open-access reader
Abstract Adjacency matrix A(G)=[aij] yields the graph energy, which is equal to the addition of absolute values of the eigenvalues G. This research investigates the energy graph class in terms of another graph class after removing a vertex. After deleting a vertex, a relationship between the energy of a complete graph E[kn ] and energy of a splitting graph E(S’ [kn ]) is discovered.
A significance statement is not available in the OpenAlex record.
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.
Abstract Adjacency matrix A(G)=[aij] yields the graph energy, which is equal to the addition of absolute values of the eigenvalues G. This research investigates the energy graph class in terms of another graph class after removing a vertex. After deleting a vertex, a relationship between the energy of a complete graph E[kn ] and energy of a splitting graph E(S’ [kn ]) is discovered.
Key concepts: Graph energy, Adjacency matrix, Regular graph, Combinatorics, Graph, Distance-regular graph, Butterfly graph, Circulant graph