Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Seidel Equienergetic Graphs
View through CrossRef
The Seidel matrix S(G) of a graph G is the square matrix with diagonal entries zeroes and off diagonal entries are – 1 or 1 corresponding to the adjacency and non-adjacency. The Seidel energy SE(G) of G is defined as the sum of the absolute values of the eigenvalues of S(G). Two graphs G1 and G2 are said to be Seidel equienergetic if SE(G1) = SE(G2). We establish an expression for the characteristic polynomial of the Seidel matrix and for the Seidel energy of the join of regular graphs. Thereby construct Seidel non cospectral, Seidel equienergetic graphs on n vertices, for all n ≥ 12
Title: Seidel Equienergetic Graphs
Description:
The Seidel matrix S(G) of a graph G is the square matrix with diagonal entries zeroes and off diagonal entries are – 1 or 1 corresponding to the adjacency and non-adjacency.
The Seidel energy SE(G) of G is defined as the sum of the absolute values of the eigenvalues of S(G).
Two graphs G1 and G2 are said to be Seidel equienergetic if SE(G1) = SE(G2).
We establish an expression for the characteristic polynomial of the Seidel matrix and for the Seidel energy of the join of regular graphs.
Thereby construct Seidel non cospectral, Seidel equienergetic graphs on n vertices, for all n ≥ 12.
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...
A note on the Seidel and Seidel Laplacian matrices
A note on the Seidel and Seidel Laplacian matrices
In this paper we investigate the spectrum of the Seidel and Seidel Laplacian matrix of a graph. We generalized the concept of Seidel Laplacian matrix which denoted by Seidel matrix...
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...
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...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Harary spectra and Harary energy of line graphs of regular graphs
Harary spectra and Harary energy of line graphs of regular graphs
The Harary matrix of a graph G is defined as RD(G) = [rij] in which rij = 1 ∕ dij if i ≠ j and rij = 0 if i = j, where dij is the distance between the vertices vi and vj in G. The ...
On Laplacian Equienergetic Signed Graphs
On Laplacian Equienergetic Signed Graphs
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 b...