Metraipolis › archive › dc_4ec5a122e7ff
Unimodular Bicyclic Graphs — arXiv:2608.21475
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21475
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:29:49.066Z
- SHA-256 of the archived text
b056b9db9f197968678947f8da9dd93489c5dea2173041740aa642785bf232b5- Stable URL of this page
https://metraipolis.com/documento/dc_4ec5a122e7ff
How to cite
Unimodular Bicyclic Graphs — arXiv:2608.21475 — arXiv (en), https://arxiv.org/abs/2608.21475 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4ec5a122e7ff (Metraipolis archive dc_4ec5a122e7ff, sha256 b056b9db9f197968678947f8da9dd93489c5dea2173041740aa642785bf232b5)
BibTeX
@misc{dc4ec5a122e7ff,
title = {Unimodular Bicyclic Graphs — arXiv:2608.21475},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21475},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4ec5a122e7ff; sha256 b056b9db9f197968678947f8da9dd93489c5dea2173041740aa642785bf232b5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21475. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G$ be a simple undirected graph with adjacency matrix $A(G)$. A graph $G$ is said to be \emph{unimodular} if $\det A(G)\in\{-1,1\}$. A connected graph with $m$ vertices and $m+k-1$ edges is called \emph{$k$-cyclic}; in particular, a bicyclic graph has $m$ vertices and $m+1$ edges. Unimodular unicyclic graphs have been completely characterized. In this paper, we investigate the corresponding problem for bicyclic graphs. We provide a complete characterization of unimodular bicyclic graphs and determine all possible values of $\det A(G)$ for a bicyclic graph $G$. Our study is motivated by the central role of unimodular graphs in the theory of graph inverses and their connections with eigenvalue reciprocity and other spectral properties of graphs.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.21475 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T08:27:54.380Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).