Degree Adjacency Diametrical Matrix of Graphs Spectral Properties and Energy Bounds
Abstract
Graph matrices that combine structural and metric information have attracted considerable attention in spectral graph theory. In this paper, we introduce the \emph{Degree--Adjacency--Diametrical (DAD) matrix} of a connected graph G. The DAD matrix is defined by (DAD(G))ij= d(vi), & if i=j, 1, & if vi∼ vj, diam(G), & if d(vi,vj)=diam(G), 0, & otherwise, where d(vi) denotes the degree of the vertex vi. We establish fundamental spectral properties of the DAD matrix by deriving trace identities, characteristic polynomials, and spectra for several classes of graphs. Furthermore, we obtain a spectral expression for the Wiener index of graphs with diameter two, derive upper bounds for the largest DAD eigenvalue, and establish lower bounds for the DAD energy. Explicit spectral characterizations are also obtained for complete multipartite graphs. The proposed matrix provides a unified spectral framework that simultaneously incorporates degree, adjacency, and diametrical information, thereby enriching the study of graph spectra and introducing a new graph matrix for spectral graph theory.
Related
- A Unified Spectral Framework for Weighted Adjacency-Degree Matrices of Dendrimer and Bethe Trees
- Adjacency-degree algebras and spectral determination of graphs
- Punctured adjacency-degree algebras of Cartesian products
- Uniform adjacency-degree probes from differential rigidity
- Open Problems on the Null Space and Image Space of the Adjacency Matrix
BibTeX
@misc{prabha2026degree,
title = {{Degree Adjacency Diametrical Matrix of Graphs Spectral Properties and Energy Bounds}},
author = {Celine Prabha S and Dhivviyanandam I},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.13114},
eprint = {2610.13114},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.13114},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Degree Adjacency Diametrical Matrix of Graphs Spectral Properties and Energy Bounds
AU - Celine Prabha S
AU - Dhivviyanandam I
PY - 2026
DA - 2026/10/09
PB - arXiv
DO - 10.48550/arxiv.2610.13114
UR - https://arxiv.org/abs/2610.13114
AB - Graph matrices that combine structural and metric information have attracted considerable attention in spectral graph theory. In this paper, we introduce the \emph{Degree--Adjacency--Diametrical (DAD) matrix} of a connected graph G. The DAD matrix is defined by (DAD(G))_ij= d(v_i), & if i=j, 1, & if v_i∼ v_j, diam(G), & if d(v_i,v_j)=diam(G), 0, & otherwise, where d(v_i) denotes the degree of the vertex v_i. We establish fundamental spectral properties of the DAD matrix by deriving trace identities, characteristic polynomials, and spectra for several classes of graphs. Furthermore, we obtain a spectral expression for the Wiener index of graphs with diameter two, derive upper bounds for the largest DAD eigenvalue, and establish lower bounds for the DAD energy. Explicit spectral characterizations are also obtained for complete multipartite graphs. The proposed matrix provides a unified spectral framework that simultaneously incorporates degree, adjacency, and diametrical information, thereby enriching the study of graph spectra and introducing a new graph matrix for spectral graph theory.
ER -