arXiv (All)
open access
Extremal Graphs with Prescribed Parameters for the Spectral Radius of Weighted Adjacency Matrices with Property $P^{\ast}$
In the literature, several graph matrices based on vertex degrees have been introduced, and the study of their spectral properties has attracted considerable attention in recent years. Motivated by these developments, in this paper, we investigate the spectral radius of the weighted adjacency matrix
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
- The spectral edge of sparse directed Erdös-Rényi graphs#1012556
- Limiting shape of alternating sign matrices#1123401
- Asymptotic stability of Cayley graphs on abelian groups#1013501
- Distributed-Memory Breadth-First Search on Massive Graphs#614756
- Good Quantum Locally Testable Codes from Lossless Cubical Complexes#1155460
Record · ID 1104502
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