Title of article
Counting the number of spanning trees of graphs
Author/Authors
GHORBANI، M نويسنده Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, 16785-136, I. R. Iran , , BANI-ASADI ، E نويسنده Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, 16785-136, I. R. Iran ,
Issue Information
دوفصلنامه با شماره پیاپی 0 سال 2013
Pages
11
From page
111
To page
121
Abstract
يك درخت فراگير از گراف G يك زير گراف از G شامل تمام ريوس آن است كه درخت مي باشد. در اين مقاله ما روي (n,m)- گراف ها متمركز مي شويم، جاييكه m = n, n+1,n+2,n+3,n+4. همچنين به تعدادكافي از ضراوب چندجمله اي مشخصه لاپلاسي از گراف هاي فولريني را بدست مي آوريم.
لغات كليدي: درخت فراگير، مقدار ويژه لاپلاسي، فولرين.
Abstract
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus
our attention on (n,m) graphs, where m = n, n + 1, n + 2 and n + 3. We also determine some
coefficients of the Laplacian characteristic polynomial of fullerene graphs.
Journal title
Iranian Journal of Mathematical Chemistry
Serial Year
2013
Journal title
Iranian Journal of Mathematical Chemistry
Record number
1239930
Link To Document