The connectivities of leaf graphs of 2-connected graphs
From MaRDI portal
Given a connected graph \(G=(V,E)\), its leaf graph \(\mathcal G\) has as vertex set the set of all spanning trees of \(G\); two vertices \(S\) and \(T\) of \(\mathcal G\) are adjacent exactly when there exists \(v\in V\) such that \(S-v=T-v\) is a connected subgraph of \(G\). Theorem: If \(G\) is biconnected with least valence \(\delta\), then \(\mathcal G\) is \((2\delta-2)\)-connected. Conjecture: If \(G\) is biconnected with \(\delta\geq 3\), then \(\mathcal G\) is hamiltonian.
Recommendations
Cites work
Cited in
(7)- The connectivities of leaf graphs of sets of points in the plane
- scientific article; zbMATH DE number 1109399 (Why is no real title available?)
- Robust connectivity of graphs on surfaces
- Connectivity and Diagnosability of Leaf-Sort Graphs
- scientific article; zbMATH DE number 2192218 (Why is no real title available?)
- Spanning trees: A survey
- On shortest path, \textsf{BFS}- and \textsf{DFS}-tree graphs
This page was built for publication: The connectivities of leaf graphs of 2-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306305)
