Some New Results on Seidel Equienergetic Graphs

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Vaidya, Samir K., Popat, Kalpesh M.
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910162043797504
author Vaidya, Samir K.
Popat, Kalpesh M.
author_facet Vaidya, Samir K.
Popat, Kalpesh M.
contents The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Some variants of energy can also be found in the literature which are defined on the concepts of Laplacian matrix, Distance matrix, Common neighbourhood matrix and Seidel matrix. The Seidel matrix of the graph $G$ is the square matrix in which $ij^{th}$ entry is $-1$ or $1$, if the vertices $v_i$ and $v_j$ are adjacent or non-adjacent respectively, and is $0$ , if $v_i=v_j.$ The Seidel energy of $G$ is the sum of the absolute values of the eigenvalues of its Seidel matrix. We present here some graph families which are Seidel equienergetic.
format Preprint
id arxiv_https___arxiv_org_abs_2604_22252
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Some New Results on Seidel Equienergetic Graphs
Vaidya, Samir K.
Popat, Kalpesh M.
Combinatorics
Spectral Theory
05C50, 05C76
The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Some variants of energy can also be found in the literature which are defined on the concepts of Laplacian matrix, Distance matrix, Common neighbourhood matrix and Seidel matrix. The Seidel matrix of the graph $G$ is the square matrix in which $ij^{th}$ entry is $-1$ or $1$, if the vertices $v_i$ and $v_j$ are adjacent or non-adjacent respectively, and is $0$ , if $v_i=v_j.$ The Seidel energy of $G$ is the sum of the absolute values of the eigenvalues of its Seidel matrix. We present here some graph families which are Seidel equienergetic.
title Some New Results on Seidel Equienergetic Graphs
topic Combinatorics
Spectral Theory
05C50, 05C76
url https://arxiv.org/abs/2604.22252