arXiv (All)
open access
Generating Functions and the Minimum Spectral Radius in Strongly Connected Digraphs with $m+2$ Edges
We study the minimum adjacency spectral radius in the class $\mathcal{SC}_{m+2}(m)$ of strongly connected digraphs with $m$ vertices and $m+2$ edges. Using generating functions for directed paths, we associate with the relevant digraphs topological polynomials whose smallest positive roots determine
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
- Counting factorizations of Singer cycles in linear and unitary groups#1122943
- INVITED REVIEW: What is a population? An empirical evaluation of some genetic methods for identifying the number of gene pools and their degree of connectivity#10614
- 42 U.S.C. § 13573 — Generation projects#589577
- 42 U.S.C. § 1591d — Powers as cumulative and additional#593761
- Adaptive rewiring shapes structure and stability in a three-guild herbivore-plant-pollinator network#447043
Record · ID 1012554
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