arXiv (All)
open access
Perfect matchings and $A_α$-spectral radius in 1-binding graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. For $α\in[0,1)$, we use $A_α(G)$ and $ρ_α(G)$ to denote the $A_α$-matrix and the $A_α$-spectral radius of $G$, respectively. The binding number $\mbox{bind}(G)$ of $G$ is defined by $\mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptys
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
- An Alon-Boppana Bound for the Non-Backtracking Operator#1123879
- Sequential Euclidean connections with exponential memory: distributional performance and adversarial robustness#793919
- Sequential Euclidean connections with exponential memory: distributional performance and adversarial robustness#789900
- On nut graphs with two vertex and three edge orbits#1076743
- An Inexact Augmented Lagrangian Method for $(L_0, L_1)$-Smooth Convex Optimization#819718
Record · ID 1062893
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