Distance Seidel matrix of a connected graph

arXiv2210.05940MaRDI QIDQ6413653FDOQ6413653

Authors: Haritha T, Chithra A 

Publication date: 12 October 2022

Abstract: For a connected graph $G$, we present the concept of a new graph matrix related to its distance and Seidel matrix, called distance Seidel matrix $mathcal{D}^S(G)$. Suppose that the eigenvalues of $mathcal{D}^S(G)$ be $partia{l}_1^S(G)geqcdotsgeqpartia{l}_n^S(G).$ In this article, we establish a relationship between distance Seidel eigenvalues of a graph with its distance and adjacency eigenvalues. We characterize all the connected graphs with $partia{l}_1^S(G)=3.$ Also, we determine different bounds for the distance Seidel spectral radius and distance Seidel energy. We study the distance Seidel energy change of the complete bipartite graph due to the deletion of an edge. Moreover, we obtain the distance Seidel spectra of different graph operations such as join, cartesian product, lexicographic product, and unary operations like the double graph and extended double cover graph. We give various families of distance Seidel cospectral and distance Seidel integral graphs as an application.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

This page was built for publication: Distance Seidel matrix of a connected graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6413653)