Forest decompositions of graphs with cyclomatic number 3 (Q790822): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: John Mitchem / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: John Mitchem / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2143306530 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:28, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Forest decompositions of graphs with cyclomatic number 3 |
scientific article |
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
