The Number of Spanning Trees of the Cartesian Product of Regular Graphs
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-07-14
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
The number of spanning trees in graphs or in networks is an important issue.
The evaluation of this number not only is interesting from a mathematical (computational) perspective but also is an important measure of reliability of a network or designing electrical circuits.
In this paper, a simple formula for the number of spanning trees of the Cartesian product of two regular graphs is investigated.
Using this formula, the number of spanning trees of the four well-known regular networks can be simply taken into evaluation.
American Psychological Association (APA)
Wu, Mei-Hui& Chung, Long-Yeu. 2014. The Number of Spanning Trees of the Cartesian Product of Regular Graphs. Mathematical Problems in Engineering،Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-495792
Modern Language Association (MLA)
Wu, Mei-Hui& Chung, Long-Yeu. The Number of Spanning Trees of the Cartesian Product of Regular Graphs. Mathematical Problems in Engineering No. 2014 (2014), pp.1-9.
https://search.emarefa.net/detail/BIM-495792
American Medical Association (AMA)
Wu, Mei-Hui& Chung, Long-Yeu. The Number of Spanning Trees of the Cartesian Product of Regular Graphs. Mathematical Problems in Engineering. 2014. Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-495792
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-495792
