Back to Search
Start Over
The number of spanning trees in circulant graphs
- Publication Year :
- 2000
-
Abstract
- In this paper we develop a method for determining the exact number of spanning trees in (directed or undirected) circulant graphs. Using this method we can, for any class of circulant graph, exhibit a recurrence relation for the number of its spanning trees. We describe the method and give examples of its use. (C) 2000 Elsevier Science B.V. All rights reserved.
Details
- Database :
- OAIster
- Notes :
- English
- Publication Type :
- Electronic Resource
- Accession number :
- edsoai.ocn895556153
- Document Type :
- Electronic Resource