Do nearly balanced multigraphs have more spanning trees? (Q3708037): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190090306 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001770489 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algebraic Graph Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inequalities: theory of majorization and its applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximizing the number of spanning trees in a graph with n nodes and m edges / rank | |||
Normal rank | |||
Latest revision as of 10:27, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Do nearly balanced multigraphs have more spanning trees? |
scientific article |
Statements
Do nearly balanced multigraphs have more spanning trees? (English)
0 references
1985
0 references
multigraphs
0 references
spanning trees
0 references
