Title of article
The number of spanning trees in circulant graphs Original Research Article
Author/Authors
Yuanping Zhang، نويسنده , , Xuerong Yong، نويسنده , , Mordecai J. Golin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
14
From page
337
To page
350
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.
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950565
Link To Document