A simple formula for the number of spanning trees of line graphs (Q4575533): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users 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.1002/jgt.22212 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2767546365 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:18, 19 March 2024
scientific article; zbMATH DE number 6903738
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple formula for the number of spanning trees of line graphs |
scientific article; zbMATH DE number 6903738 |
Statements
A simple formula for the number of spanning trees of line graphs (English)
0 references
13 July 2018
0 references
electrical networks
0 references
line graphs
0 references
mesh-star transformation
0 references
spanning trees
0 references
subdivision
0 references
