Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On Laplacian Equienergetic Signed Graphs
View through CrossRef
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal. In this paper, we present several infinite families of Laplacian equienergetic signed graphs.
Title: On Laplacian Equienergetic Signed Graphs
Description:
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree.
Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal.
In this paper, we present several infinite families of Laplacian equienergetic signed graphs.
Related Results
On Equienergetic Graphs and Graph Energy of Some Standard Graphs with Self loops
On Equienergetic Graphs and Graph Energy of Some Standard Graphs with Self loops
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\l...
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...
The spectrum and metric dimension of Indu–Bala product of graphs
The spectrum and metric dimension of Indu–Bala product of graphs
Given a connected graph [Formula: see text], the distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], and the distance signless Laplacian matrix [Formul...
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...
Toward a Laplacian spectral determination of signed ∞-graphs
Toward a Laplacian spectral determination of signed ∞-graphs
A signed graph consists of a (simple) graph G=(V,E) together with a
function ? : E ? {+,-} called signature. Matrices can be associated to
signed graphs and the question whet...
On Laplacian Commutativity of Graphs
On Laplacian Commutativity of Graphs
This paper introduces the notion of Laplacian commutativity of graphs among well known classes of graphs. Two graphs are Laplacian commutative if their Laplacian matrices commute. ...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...