The number of spanning trees of the Cartesian product of regular graphs
From MaRDI portal
Publication:1719076
DOI10.1155/2014/750618zbMath1407.05057OpenAlexW2137003249WikidataQ59071931 ScholiaQ59071931MaRDI QIDQ1719076
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/750618
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
- Equitable colorings of Cartesian products of graphs
- Connectivity of Cartesian product graphs
- Counting the number of spanning trees in a class of double fixed-step loop networks
- Further analysis of the number of spanning trees in circulant graphs
- The number of spanning trees in directed circulant graphs with non-fixed jumps
- The distinguishing chromatic number of Cartesian products of two complete graphs
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- Spanning tree formulas and Chebyshev polynomials
- The number of spanning trees of the generalized Boolean \(n\)-cube network
- On connectivity of the cartesian product of two graphs
- The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
- A certain polynomial of a graph and graphs with an extremal number of trees
- The number of spanning trees in circulant graphs
- Complexity of products of some complete and complete bipartite graphs
- The number of spanning trees in odd valent circulant graphs
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- On the number of spanning trees in directed circulant graphs
- The number of spanning trees in a class of double fixed-step loop networks
- Graph theoretic reliability analysis for the Boolean n cube networks
- The number of spanning trees of the regular networks
- Super edge- and point-connectivities of the Cartesian product of regular graphs
This page was built for publication: The number of spanning trees of the Cartesian product of regular graphs
