Geodesic
The number of spanning trees of double graphs
Kragujevac Journal of Mathematics, Tome 35 (2011) no. 1, p. 183 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

In this article, we study the number of spanning trees of double graphs (direct product of a simple graph) and obtain some upper bounds for double graphs, especially for double tree graphs, double unicyclic graphs and double bicyclic graphs. The extremal graphs are also determined.
Classification : 05C76 05C05
Keywords: Double graphs, Number of spanning trees, Unicyclic graphs, Bicyclic graphs 
@article{KJM_2011_35_1_a15,
     author = {Liu Wu-xin and Wei Fu-yi},
     title = {The number of spanning trees of double graphs},
     journal = {Kragujevac Journal of Mathematics},
     pages = {183 },
     year = {2011},
     volume = {35},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KJM_2011_35_1_a15/}
}
TY  - JOUR
AU  - Liu Wu-xin
AU  - Wei Fu-yi
TI  - The number of spanning trees of double graphs
JO  - Kragujevac Journal of Mathematics
PY  - 2011
SP  - 183 
VL  - 35
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/KJM_2011_35_1_a15/
LA  - en
ID  - KJM_2011_35_1_a15
ER  - 
%0 Journal Article
%A Liu Wu-xin
%A Wei Fu-yi
%T The number of spanning trees of double graphs
%J Kragujevac Journal of Mathematics
%D 2011
%P 183 
%V 35
%N 1
%U http://geodesic.mathdoc.fr/item/KJM_2011_35_1_a15/
%G en
%F KJM_2011_35_1_a15
Liu Wu-xin; Wei Fu-yi. The number of spanning trees of double graphs. Kragujevac Journal of Mathematics, Tome 35 (2011) no. 1, p. 183 . http://geodesic.mathdoc.fr/item/KJM_2011_35_1_a15/