arXiv (All)
open access
Degree Adjacency Diametrical Matrix of Graphs Spectral Properties and Energy Bounds
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}= \begin{cases
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Degree-based weighted adjacency matrices: spectra, integrality, and edge deletion effects#998133
- Strengthened upper bound on the third eigenvalue of graphs#1141400
- A symmetric conference matrix of order 86#1232932
- Graph transformations and eigenvectors of the Laplacian, signless Laplacian and Adjacency matrices#1233967
- A Dichotomy for Planar Graph Homomorphisms with Nonnegative Weights#1201425
Record · ID 1297466
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive