2023Journal for Research in Applied Sciences and BiotechnologyOpen access

Energy of Graph

Najibullah Yousefi, Amrullah Awsar, Laila Popalzai

Open full text 1 citations

Abstract

By given the adjacency matrix, laplacian matrix of a graph we can find the set of eigenvalues of graph in order to discussed about the energy of graph and laplacian energy of graph. (i.e. the sum of eigenvalues of adjacency matrix and laplacian matrix of a graph is called the energy of graph) and the laplacian energy of graph is greater or equal to zero for any graph and is greater than zero for every connected graph with more or two vertices (i.e. the last eigenvalues of laplacian matrix is zero), according to several theorems about the energy of graph and the laplacian energy of graph that are described in this work; I discussed about energy of graph, laplacian energy of graph and comparing them here.

Open-access reader

About this research paper

What this paper is about

By given the adjacency matrix, laplacian matrix of a graph we can find the set of eigenvalues of graph in order to discussed about the energy of graph and laplacian energy of graph. (i.e. the sum of eigenvalues of adjacency matrix and laplacian matrix of a graph is called the energy of graph) and the laplacian energy of graph is greater or equal to zero for any graph and is greater than zero for every connected graph with more or two vertices (i.e. the last eigenvalues of laplacian matrix is zero), according to several theorems about the energy of graph and the laplacian energy of graph that are described in this work; I discussed about energy of graph, laplacian energy of graph and comparing them here.

Why it matters

OpenAlex reports 1 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

By given the adjacency matrix, laplacian matrix of a graph we can find the set of eigenvalues of graph in order to discussed about the energy of graph and laplacian energy of graph. (i.e. the sum of eigenvalues of adjacency matrix and laplacian matrix of a graph is called the energy of graph) and the laplacian energy of graph is greater or equal to zero for any graph and is greater than zero for every connected graph with more or two vertices (i.e. the last eigenvalues of laplacian matrix is zero), according to several theorems about the energy of graph and the laplacian energy of graph that are described in this work; I discussed about energy of graph, laplacian energy of graph and comparing them here.

Key concepts: Graph energy, Adjacency matrix, Laplacian matrix, Voltage graph, Butterfly graph, Distance-regular graph, Degree matrix, Combinatorics

Related papers

Back to paper searchBrowse research topicsOriginal source
Energy of Graph — Research Paper | ScholarLens