2021AIMS MathematicsOpen access

Numerous graph energies of regular subdivision graph and complete graph

Imrana Kousar, Saima Nazeer, Abid Mahboob, Sana Shahid, Yu-Pei Lv

Open full text 3 citations

Abstract

The graph energy $ E(G) $ of a simple graph $ G $ is sum of its absolute eigenvalues where eigenvalues of adjacency matrix $ A(G) $ are referred as eigenvalues of graph $ G $. Depends upon eigenvalues of different graph matrices, several graph energies has been observed recently such as maximum degree energy, Randi$ \acute{c} $ energy, sum-connectivity energy etc. Depending on the definition of a graph matrix, the graph energy can be easily determined. This article contains upper bounds of several graph energies of $ s $-regular subdivision graph $ S(G) $. Also various graph energies of complete graph are mentioned in this article.

About this research paper

What this paper is about

The graph energy $ E(G) $ of a simple graph $ G $ is sum of its absolute eigenvalues where eigenvalues of adjacency matrix $ A(G) $ are referred as eigenvalues of graph $ G $. Depends upon eigenvalues of different graph matrices, several graph energies has been observed recently such as maximum degree energy, Randi$ \acute{c} $ energy, sum-connectivity energy etc. Depending on the definition of a graph matrix, the graph energy can be easily determined. This article contains upper bounds of several graph energies of $ s $-regular subdivision graph $ S(G) $. Also various graph energies of complete graph are mentioned in this article.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The graph energy $ E(G) $ of a simple graph $ G $ is sum of its absolute eigenvalues where eigenvalues of adjacency matrix $ A(G) $ are referred as eigenvalues of graph $ G $. Depends upon eigenvalues of different graph matrices, several graph energies has been observed recently such as maximum degree energy, Randi$ \acute{c} $ energy, sum-connectivity energy etc. Depending on the definition of a graph matrix, the graph energy can be easily determined. This article contains upper bounds of several graph energies of $ s $-regular subdivision graph $ S(G) $. Also various graph energies of complete graph are mentioned in this article.

Key concepts: Graph energy, Adjacency matrix, Distance-regular graph, Regular graph, Combinatorics, Voltage graph, Butterfly graph, Cubic graph

Related papers

Back to paper searchBrowse research topicsOriginal source
Numerous graph energies of regular subdivision graph and complete graph — Research Paper | ScholarLens