The Number of Spanning Trees of the Cartesian Product of Regular Graphs

CNU IR > The Centers > The Center For General Education > Periodical Articles > Item 310902800/28713

Please use this identifier to cite or link to this item: https://ir.cnu.edu.tw/handle/310902800/28713

Title:	The Number of Spanning Trees of the Cartesian Product of Regular Graphs
Authors:	Wu, Mei-Hui Chung, Long-Yeu
Contributors:	通識教育中心資訊多媒體應用系
Keywords:	DIRECTED CIRCULANT GRAPHS K-N-COMPLEMENTS CHEBYSHEV POLYNOMIALS NETWORKS CONNECTIVITY FORMULAS
Date:	2014
Issue Date:	2015-05-06 21:26:07 (UTC+8)
Publisher:	Hindawi Publishing Corporation
Abstract:	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.
Relation:	Mathematical Problems In Engineering, 750618
Appears in Collections:	[Dept. of Multimedia and Game Development] Periodical Articles [The Center For General Education] Periodical Articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	1693	View/Open