On the number of spanning trees of a multi-complete/star related graph
From MaRDI portal
Publication:294864
DOI10.1016/S0020-0190(00)00135-6zbMATH Open1339.05189MaRDI QIDQ294864FDOQ294864
Authors: Kuo-Liang Chung, Wen-Ming Yan 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001356?np=y
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 (13)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- The number of spanning trees in a new lexicographic product of graphs
- Graph MBO on star graphs and regular trees. With corrections to DOI 10.1007/s00032-014-0216-8
- 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
- The number of spanning trees in the composition graphs
- On the number of spanning trees of \(K^m_n \pm G\) graphs
- On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
- Title not available (Why is that?)
- The number of spanning trees in \(K_n\)-complement of a bipartite graph
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
- A limit characterization for the number of spanning trees of graphs
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)
