๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A homology theory for spanning tress of a graph

โœ Scribed by L. Lovasz

Book ID
105393120
Publisher
Akadmiai Kiad
Year
1977
Tongue
English
Weight
590 KB
Volume
30
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The number of spanning trees of a graph
The number of spanning trees of a graph
โœ Jianxi Li; Wai Chee Shiu; An Chang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 387 KB

In 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.

Spanning trees fixed by automorphisms of
Spanning trees fixed by automorphisms of a graph
โœ M. Kano; A. Sakamoto ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB

Let G be a finite graph and A be a subgroup of Aut(G). We give a necessary and sufficient condition for the graph G to have an A-invariant spanning tree.