On the asymptotic behavior of the maximum number of spanning trees in circulant graphs.

Zbigniew Lonc Krzysztof Parol Jacek Wojciechowski

Published in: Networks (1997)

Keyphrases

spanning tree
maximum number
minimum spanning tree
minimum spanning trees
edge disjoint
minimum cost
undirected graph
minimum weight
weighted graph
fourier transform
root node
human behavior
edge weights
search engine
depth first search
worst case
special case
minimum total cost
bayesian networks