Javascript must be enabled to continue!
On Equienergetic Graphs and Graph Energy of Some Standard Graphs with Self loops
View through CrossRef
Abstract
Let $G_S$ be the graph of order $n$ and containing $\sigma$ self-loops. The energy $E(G_S)$ of graph $G_S$ is defined as $E(G_S)=\displaystyle\sum_{i=1}^{n}\bigg\lvert\lambda_i-\dfrac{\sigma}{n}\bigg\rvert$, where $\lambda_1, \lambda_2, \dots, \lambda_n$ be the eigenvalues of the adjacency matrix of $G_S$. Two non-isomorphic graphs $G_1$ and $G_2$ of the same order are said to be equienergetic if they have same energy. The proposed research is an effort to expand the concept of equienergetic graphs from simple graphs to graphs having self-loops. In the present work, we have obtained a pair of equienergetic graphs and the energy of complete graphs as well as complete bipartite graphs with self loops.
Title: On Equienergetic Graphs and Graph Energy of Some Standard Graphs with Self loops
Description:
Abstract
Let $G_S$ be the graph of order $n$ and containing $\sigma$ self-loops.
The energy $E(G_S)$ of graph $G_S$ is defined as $E(G_S)=\displaystyle\sum_{i=1}^{n}\bigg\lvert\lambda_i-\dfrac{\sigma}{n}\bigg\rvert$, where $\lambda_1, \lambda_2, \dots, \lambda_n$ be the eigenvalues of the adjacency matrix of $G_S$.
Two non-isomorphic graphs $G_1$ and $G_2$ of the same order are said to be equienergetic if they have same energy.
The proposed research is an effort to expand the concept of equienergetic graphs from simple graphs to graphs having self-loops.
In the present work, we have obtained a pair of equienergetic graphs and the energy of complete graphs as well as complete bipartite graphs with self loops.
Related Results
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Characterization of dislocation loops in hydrogen-ion irradiated vanadium
Characterization of dislocation loops in hydrogen-ion irradiated vanadium
Vanadium alloys are considered as the candidate materials for structure application in fusion reactors because of their low radiation-induced activation, high resistance to radiati...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Is a Fitbit a Diary? Self-Tracking and Autobiography
Is a Fitbit a Diary? Self-Tracking and Autobiography
Data becomes something of a mirror in which people see themselves reflected. (Sorapure 270)In a 2014 essay for The New Yorker, the humourist David Sedaris recounts an obsession spu...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...

