A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs
[chapter]
2004
Lecture Notes in Computer Science
Circulant graphs are an extremely well-studied subclass of regular graphs, partially because they model many practical computer network topologies. It has long been known that the number of spanning trees in n-node circulant graphs with constant jumps satisfies a recurrence relation in n. For the non-constant-jump case, i.e., where some jump sizes can be functions of the graph size, only a few special cases such as the Möbius ladder had been studied but no general results were known. In this
doi:10.1007/978-3-540-30551-4_45
fatcat:6xcw6m3y65fa5nx2rl5jdel55q