Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 16, 1984 - Issue 4
Submit an article Journal homepage
23
Views
19
CrossRef citations to date
0
Altmetric
Original Articles

On the number of spanning trees of circulant graphs

J. F. Wang Department of Electrical Engineering, National Cheng Kung University, Taiwan, Tainan, Republic of China
&
C. S. Yang Department of Electrical Engineering, National Cheng Kung University, Taiwan, Tainan, Republic of China
Pages 229-241 | Published online: 19 Mar 2007
 
Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

Abstract

In this paper, we derive a simple formula for the number of spanning trees of the circulant graphs. Some special cases of the circulant graphs are also taken into account.

C.R. Categories::

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.