Forest decompositions of graphs with cyclomatic number 3 (Q790822)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Forest decompositions of graphs with cyclomatic number 3 |
scientific article; zbMATH DE number 3849251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Forest decompositions of graphs with cyclomatic number 3 |
scientific article; zbMATH DE number 3849251 |
Statements
Forest decompositions of graphs with cyclomatic number 3 (English)
0 references
1983
0 references
A graph G has cyclomatic number n if n is the fewest number of edges whose removal will result in an acyclic graph. Simple tree polynomials of the basic graphs with cyclomatic number 3 are derived. These results are used to develop formulae for the number of spanning trees with specified cardinalities. Expressions are also given for the number of spanning forests and spanning trees in graphs of cyclomatic number 3.
0 references
cyclomatic number
0 references
tree polynomials
0 references
spanning trees
0 references
0.7799084186553955
0 references
0.7795219421386719
0 references
