|
HKUST Institutional Repository >
Computer Science and Engineering >
CSE Preprints >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1783.1/466
|
| Title: | The Number of spanning trees in circulant graphs |
| Authors: | Zhang, Yuanping
Yong, Xuerong
Golin, Mordecai J. |
| Keywords: | Number of spanning trees
Circulant graphs |
| Issue Date: | 1999 |
| Citation: | Discrete mathematics, v. 223, 2000, p. 337-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. |
| URI: | http://hdl.handle.net/1783.1/466 |
| Appears in Collections: | CSE Preprints
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| Circulant1.pdf | | 265Kb | Adobe PDF | View/Open |
|
All items in this Repository are protected by copyright, with all rights reserved.
|
