Metraipolis › archive › dc_b4fb4cb55cec

Maximum number of spanning trees in bipartite graphs with a given diameter — arXiv:2609.15502

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15502
License (as archived)
CC0-1.0
Archived
2026-10-16T01:25:29.463Z
SHA-256 of the archived text
0ebf4af8dab9fb47fdd092ff350e8c397b60f84da7fcc8fa0d147d417ac01713
Stable URL of this page
https://metraipolis.com/documento/dc_b4fb4cb55cec

How to cite

Maximum number of spanning trees in bipartite graphs with a given diameter — arXiv:2609.15502 — arXiv (en), https://arxiv.org/abs/2609.15502 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b4fb4cb55cec (Metraipolis archive dc_b4fb4cb55cec, sha256 0ebf4af8dab9fb47fdd092ff350e8c397b60f84da7fcc8fa0d147d417ac01713)
BibTeX
@misc{dcb4fb4cb55cec,
  title = {Maximum number of spanning trees in bipartite graphs with a given diameter — arXiv:2609.15502},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15502},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b4fb4cb55cec; sha256 0ebf4af8dab9fb47fdd092ff350e8c397b60f84da7fcc8fa0d147d417ac01713},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15502. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The number of spanning trees is a classical graph invariant and an important measure of network reliability, as it counts the minimal connected spanning substructures that can maintain communication in a network. Let $\mathcal{B}(n,d)$ be the set of connected bipartite graphs of order $n$ and diameter $d$. Motivated by reliability design problems for bipartite network models with fixed order and diameter, this paper determines all graphs with the maximum number of spanning trees in $\mathcal{B}(n,d)$. The result gives an extremal characterization of bipartite network topologies with the largest number of connected spanning backbones under prescribed order and diameter constraints, and provides a structural reference for the design of reliable bipartite networks.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.15502 — 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-16T00:39:30.244Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).