On the number of spanning trees of a multi-complete/star related graph
From MaRDI portal
(Redirected from Publication:294864)
Recommendations
- A formula for the number of spanning trees of a multi-star related graph
- On the number of spanning trees of multi-star related graphs
- On the number of spanning trees of \(K^m_n \pm G\) graphs
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- scientific article; zbMATH DE number 2076810
Cites work
Cited in
(14)- A limit characterization for the number of spanning trees of graphs
- Graph MBO on star graphs and regular trees. With corrections to DOI 10.1007/s00032-014-0216-8
- The number of spanning trees in the composition graphs
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- Counting spanning trees of multiple complete split-like graph containing a given spanning forest
- The number of spanning trees in \(K_n\)-complement of a bipartite graph
- On the number of spanning trees of \(K^m_n \pm G\) graphs
- The number of spanning trees in a new lexicographic product of graphs
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
- On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
- scientific article; zbMATH DE number 2230252 (Why is no real title available?)
- On the number of spanning trees of multi-star related graphs
- A formula for the number of spanning trees of a multi-star related graph
- Spanning tree of a multiple graph
This page was built for publication: On the number of spanning trees of a multi-complete/star related graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294864)