Staff Members - Benha University
E. M. Badr and B. ohamed (2015) " Enumeration of the Number of Spanning Trees for the Subdivision Technique of Five New Classes of Graphs" Applied Mathematical Sciences, Vol. 9, 2015, no. 147, 7327 - 7334. [ISI Indexed: SJR 0.15]
Applied Mathematical Sciences • 2015
Publication Information
Authors
E.M.Badr and B. Mohamed
Keywords
Not Available
Journal
Applied Mathematical Sciences
Publisher
HIKARI Ltd
Volume
Vol. 9, 2015, no. 147, 7327 - 7334
Issue
149
Pages
7327-7334
publication.type
International
Paper Link
Open Link
Supplementary Materials
Not Available
Abstract
Our paper has two goals:
i) We propose the combinatorial approach to facilitate the calculation of the
number of spanning trees for five new classes of graphs.
ii) We use a new powerful operation (subdivision) to get larger graphs from a
given graph.
In particular, we derive the explicit formulas for the subdivision of ladder, fan,
triangular snake, double triangular snake and the total graph of path Pn.
i) We propose the combinatorial approach to facilitate the calculation of the
number of spanning trees for five new classes of graphs.
ii) We use a new powerful operation (subdivision) to get larger graphs from a
given graph.
In particular, we derive the explicit formulas for the subdivision of ladder, fan,
triangular snake, double triangular snake and the total graph of path Pn.