The number of spanning trees in some circulant graphs with non-fixed jumps

zbMATH Open1150.05318MaRDI QIDQ3501255FDOQ3501255

Yuanping Zhang, Zhi-Yong 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

zbMATH Keywords

recurrence relationcirculant graphnumber of spanning trees

Mathematics Subject Classification ID

Trees (05C05)

Cited In (7)

• Graph-Theoretic Concepts in Computer Science
• 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)