arXiv (OAI Expanded)
open access
Maximum number of spanning trees in bipartite graphs with a given diameter
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 diamet
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
- Weak $k$-metric dimension of Hamming graphs: rectangular products and near-maximum parameters#1116492
- Crown graphs maximise the representation number of bipartite graphs#1130684
- Vizing's theorem for signed multigraphs#1117820
- A stronger upper bound on the D-chromatic index#822295
- Majority C-coloring in Cartesian products#780968
Record · ID 1109503
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