Staff Members - Benha University
E. M. Badr and B. Mohamed (2015) ,"Generating Recursive Formulas for the Number of Spanning Trees in Cyclic Snakes Networks", 4nd International Conference on Mathematics and Information Science, 5-7Feb.2015,Zewail City of Science and Technology, Cairo, Egypt.
• 2015
Publication Information
Authors
E. M. Badr and B.Mohamed
Keywords
Not Available
Journal
Not Available
Publisher
Not Available
Volume
Not Available
Issue
Not Available
Pages
Not Available
publication.type
International
Paper Link
Not Available
Supplementary Materials
Not Available
Abstract
Calculating the number of spanning trees of a graph G by the determinant of Laplacian matrix is tedious and impractical. In this paper, we propose the combinatorial method to facilitate the calculation of the number of spanning trees for some graphs. In particular, we derive the explicit formulas for the triangular snake ( -snake), double triangular snake (2 -snake) and the total graph of path Pn ( T(Pn) ). Finally, we derive the explicit formulas for the subdivision of -snake, 2 -snake and T(Pn).