AbstractIn this paper, we present some sharp upper bounds for the number of spanning trees of a connected graph in terms of its structural parameters such as the number of vertices, the number of edges, maximum vertex degree, minimum vertex degree, connectivity and chromatic number
The K_n-complement of a graph G, denoted by K_n-G, is defined as the graph obtained from the complet...
Theorem 1. (1) A planar graph with n vertices has at most 5.33333333... n spanning trees. (2) A plan...
The spanning tree packing number of a connected graph G, denoted by T(G), is the maximum number of e...
AbstractIn this paper, we present some sharp upper bounds for the number of spanning trees of a conn...
Copyright © 2014 Ş. B. Bozkurt and D. Bozkurt.This is an open access article distributed under the ...
The history of counting the number of spanning trees dates back into the year 1842 in which the Germ...
A connected graph having large minimum vertex degree must have a spanning tree with many leaves. In ...
AbstractIt is shown that an n-edge connected graph has at least ⌈(n − 1)2⌉ pairwise edge-disjoint sp...
AbstractFor a connected simple graph G let L(G) denote the maximum number of leaves in any spanning ...
Tema ovog rada su različiti načini prebrojavanja razapinjućih stabala. Prvo se predstavljaju osnovni...
AbstractLi et al. [J.X. Li, W.C. Shiu, A. Chang, The number of spanning trees of a graph, Appl. Math...
The number of spanning trees in a (di-)graph (network) is an important, well-studied quantity. Most ...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
In this paper we propose a limit characterization of the behaviour of classes of graphs with respec...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
The K_n-complement of a graph G, denoted by K_n-G, is defined as the graph obtained from the complet...
Theorem 1. (1) A planar graph with n vertices has at most 5.33333333... n spanning trees. (2) A plan...
The spanning tree packing number of a connected graph G, denoted by T(G), is the maximum number of e...
AbstractIn this paper, we present some sharp upper bounds for the number of spanning trees of a conn...
Copyright © 2014 Ş. B. Bozkurt and D. Bozkurt.This is an open access article distributed under the ...
The history of counting the number of spanning trees dates back into the year 1842 in which the Germ...
A connected graph having large minimum vertex degree must have a spanning tree with many leaves. In ...
AbstractIt is shown that an n-edge connected graph has at least ⌈(n − 1)2⌉ pairwise edge-disjoint sp...
AbstractFor a connected simple graph G let L(G) denote the maximum number of leaves in any spanning ...
Tema ovog rada su različiti načini prebrojavanja razapinjućih stabala. Prvo se predstavljaju osnovni...
AbstractLi et al. [J.X. Li, W.C. Shiu, A. Chang, The number of spanning trees of a graph, Appl. Math...
The number of spanning trees in a (di-)graph (network) is an important, well-studied quantity. Most ...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
In this paper we propose a limit characterization of the behaviour of classes of graphs with respec...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
The K_n-complement of a graph G, denoted by K_n-G, is defined as the graph obtained from the complet...
Theorem 1. (1) A planar graph with n vertices has at most 5.33333333... n spanning trees. (2) A plan...
The spanning tree packing number of a connected graph G, denoted by T(G), is the maximum number of e...
DOI
Add to ORKG