The number of spanning trees in some circulant graphs with non-fixed jumps
From MaRDI portal
Publication:3501255
zbMATH Open1150.05318MaRDI QIDQ3501255FDOQ3501255
Authors: Zhi-Yong Zhang, Yuanping Zhang 
Publication date: 3 June 2008
Recommendations
- The number of spanning trees in circulant graphs
- An efficient approach for counting the number of spanning trees in circulant and related graphs
- The number of spanning trees in the undirected circulant graphs with non-fixed jumps
- The number of spanning trees in directed circulant graphs with non-fixed jumps
- Algorithms and Computation
Cited In (8)
- Graph-Theoretic Concepts in Computer Science
- Number of spanning trees of some circulant graphs and their asymptotic behavior
- The non-\(\ell\)-part of the number of spanning trees in abelian \(\ell\)-towers of multigraphs
- An efficient approach for counting the number of spanning trees in circulant and related graphs
- The number of spanning trees in directed circulant graphs with non-fixed jumps
- The number of spanning trees in the undirected circulant graphs with non-fixed jumps
- The number of spanning trees in circulant graphs
- Algorithms and Computation
This page was built for publication: The number of spanning trees in some circulant graphs with non-fixed jumps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3501255)
