Upper bounds for the number of spanning trees of graphs (Q387931): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59271915, #quickstatements; #temporary_batch_1710982311091 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An upper bound for the number of spanning trees of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A bound for the complexity of a simple graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A sharp upper bound for the number of spanning trees of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sharp upper bounds for the number of spanning trees of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of spanning trees of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on Randić indices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Determinants with Elements ± 1 / rank | |||
Normal rank |
Revision as of 03:43, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Upper bounds for the number of spanning trees of graphs |
scientific article |
Statements
Upper bounds for the number of spanning trees of graphs (English)
0 references
17 December 2013
0 references
graph
0 references
spanning trees
0 references
normalized Laplacian eigenvalues
0 references