arXiv (All)
open access
On the distribution of $A_α$-eigenvalues in terms of graph invariants
Let $G$ be a connected graph of order $n$, and $A(G)$ and $D(G)$ its adjacency and degree diagonal matrices, respectively. For a parameter $α\in [0,1]$, Nikiforov~(2017) introduced the convex combination $A_α(G) = αD(G) + (1 - α)A(G)$. In this paper, we investigate the spectral distribution of $A_α(
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
- Perfect matchings and $A_α$-spectral radius in 1-binding graphs#1062893
- Local energy and vertex deletion for $A_α$-matrices#1389463
- Computing matrix functions associated with a Hermitian-definite pencil#925830
- Tracy Widom law for sample covariance matrices under quadratic form concentration#1534591
- Quantum walks and graph operations#1217048
Record · ID 1535488
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