Title of article
NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
Author/Authors
Rahami, H. university of tehran - School of Engineering Science, College of Engineering, تهران, ايران , Kaveh, A. iran university of science and technology - Centre of Excellence for Fundamental Studies in Structural Engineering, تهران, ايران
From page
121
To page
135
Abstract
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was not possible, first their Laplacian matrices are transformed into single block diagonal forms and then using the concept of determinant, the calculations are performed.
Keywords
Graph product , Cartesian , strong Cartesian , direct , lexicographic , double graph , spanning trees , Laplacian matrix , determinant , eigenvalues
Journal title
International Journal of Optimization in Civil Engineering
Journal title
International Journal of Optimization in Civil Engineering
Record number
2566595
Link To Document