The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic.

Alexander D. Mednykh Ilya A. Mednykh

Published in: Discret. Math. (2019)

Keyphrases

spanning tree
undirected graph
small number
computational complexity
minimum spanning trees
minimum spanning tree
random graphs
neural network
model selection
directed graph
bipartite graph
minimum cost
edge weights
edge disjoint