scientific article; zbMATH DE number 140113

zbMATH Open0764.05067MaRDI QIDQ4028491FDOQ4028491

Authors: Jon A. Sjogren 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

Recommendations

• On the number of spanning trees of circulant graphs
• The numbers of spanning trees of some families of circulant graphs
• The number of spanning trees in circulant graphs
• The numbers of spanning trees in undirected circulant graphs
• Coding and counting spanning trees in Kleitman-Golden graphs

zbMATH Keywords

spanning treesreliabilityFibonacci sequencegraph isomorphismcircular graphsfault-tolerant communications networksformula of Kleitman and Goldenrotationally symmetric graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05)

Cited In (5)

• On the number of spanning trees of circulant graphs
• Coding and counting spanning trees in Kleitman-Golden graphs
• Circulant blocks and rotational graphs
• Counting spanning trees in the graphs of Kleitman and Golden and a generalization
• The spanning trees formulas in a class of double fixed-step loop networks (extended abstract)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028491)