A formula for the number of spanning trees of a multi-star related graph (Q293471): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5602686 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of spanning trees of multi-star related graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules / rank | |||
Normal rank | |||
Latest revision as of 02:39, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A formula for the number of spanning trees of a multi-star related graph |
scientific article |
Statements
A formula for the number of spanning trees of a multi-star related graph (English)
0 references
9 June 2016
0 references
combinatorial problems
0 references
spanning trees
0 references
multi-star graph
0 references
