Spanning trees in directed circulant graphs and cycle power graphs
Abstract
The number of spanning trees in a class of directed circulant graphs with generators depending linearly on the number of vertices β n, and in the n-th and (n-1)-th power graphs of the β n-cycle are evaluated as a product of β/2-1 terms.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.