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

Chia Nan University of Pharmacy & Science Institutional Repository > 中心級單位 > 通識教育中心 > 期刊論文 > Item 310902800/28713

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://ir.cnu.edu.tw/handle/310902800/28713

標題:	The Number of Spanning Trees of the Cartesian Product of Regular Graphs
作者:	Wu, Mei-Hui Chung, Long-Yeu
貢獻者:	通識教育中心資訊多媒體應用系
關鍵字:	DIRECTED CIRCULANT GRAPHS K-N-COMPLEMENTS CHEBYSHEV POLYNOMIALS NETWORKS CONNECTIVITY FORMULAS
日期:	2014
上傳時間:	2015-05-06 21:26:07 (UTC+8)
出版者:	Hindawi Publishing Corporation
摘要:	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.
關聯:	Mathematical Problems In Engineering, 750618
显示于类别:	[多媒體與遊戲發展系] 期刊論文 [通識教育中心] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	1748	检视/开启

在CNU IR中所有的数据项都受到原著作权保护.

TAIR相关文章