A formula for the number of spanning trees of a multi-star related graph
DOI10.1016/S0020-0190(98)00175-6zbMATH Open1339.05192MaRDI QIDQ293471FDOQ293471
Wen-Ming Yan, Kuo-Liang Chung, Wendy Myrvold
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001756?np=y
Recommendations
- On the number of spanning trees of multi-star related graphs
- On the number of spanning trees of a multi-complete/star related graph
- A formula for the number of spanning trees of \(K_{n^m}[G]\)
- scientific article; zbMATH DE number 5532173
- scientific article
- On the number of spanning trees in graphs with multiple edges
- The formulas for the number of spanning trees in circulant graphs
- scientific article; zbMATH DE number 2095780
- The number of spanning trees of a graph
- The number of spanning trees of a graph
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
Cited In (10)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- A simple formula for the number of spanning trees of line graphs
- On the number of spanning trees of a multi-complete/star related graph
- On the number of spanning trees of \(K^m_n \pm G\) graphs
- Title not available (Why is that?)
- The number of spanning trees in \(K_n\)-complement of a bipartite graph
- A limit characterization for the number of spanning trees of graphs
- Counting spanning trees using modular decomposition
- The number of spanning trees of the Cartesian product of regular graphs
This page was built for publication: A formula for the number of spanning trees of a multi-star related graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293471)
