|
|
|
|
Counting the number of spanning trees of graphs
|
|
|
|
|
|
|
|
نویسنده
|
GHORBANI M ,BANI-ASADI E
|
|
منبع
|
iranian journal of mathematical chemistry - 2013 - دوره : 4 - شماره : 1 - صفحه:111 -121
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Spanning tree ,Laplacian eigenvalue ,fullerene
|
|
آدرس
|
shahid rajaee teacher training university, ایران, shahid rajaee teacher training university, ایران
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|