On the number of spanning trees of multi-star related graphs
DOI10.1016/S0020-0190(98)00008-8zbMATH Open1339.05191OpenAlexW2002378808MaRDI QIDQ293235FDOQ293235
Authors: S. D. Nikolopoulos, Panos Rondogiannis
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/S0020019098000088?np=y
Recommendations
- On the number of spanning trees of a multi-complete/star related graph
- A formula for the number of spanning trees of a multi-star related graph
- 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
- Number of spanning trees of different products of complete and complete bipartite graphs
spanning treesinterconnection networkscombinatorial problemscomplement spanning tree matrix theoremmulti-star graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Uniformly-most reliable networks do not always exist
- Title not available (Why is that?)
Cited In (15)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- The number of spanning trees of double graphs
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- Graph MBO on star graphs and regular trees. With corrections to DOI 10.1007/s00032-014-0216-8
- Counting the number of spanning trees in the star flower planar map
- A formula for the number of spanning trees of a multi-star related graph
- 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?)
- On two conjectures concerning spanning tree edge dependences of graphs
- The number of spanning trees in \(K_n\)-complement of a bipartite graph
- Counting spanning trees in graphs using modular decomposition
- 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: On the number of spanning trees of multi-star related graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293235)