A new technique for the characterization of graphs with a maximum number of spanning trees (Q1349105): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(01)00095-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077157637 / rank | |||
Normal rank | |||
Latest revision as of 11:38, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new technique for the characterization of graphs with a maximum number of spanning trees |
scientific article |
Statements
A new technique for the characterization of graphs with a maximum number of spanning trees (English)
0 references
21 May 2002
0 references
spanning trees
0 references
\(t\)-optimal graphs
0 references
characterizations
0 references
degree sequence
0 references
multipartite graphs
0 references
