Comparison of graphs by their number of spanning trees (Q1233439): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / cites work
 
Property / cites work: Q5648382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exceptional Case in a Characterization of the Arcs of a Complete Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations of a graph increasing its Laplacian polynomial and number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A certain polynomial of a graph and graphs with an extremal number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Число Деревьев Графа, Содержащих Заднный Лес / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of graphs by their number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181633 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(76)90102-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970826561 / rank
 
Normal rank

Latest revision as of 10:32, 30 July 2024