Undirected simple connected graphs with minimum number of spanning trees (Q1025924): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Least reliable networks and the reliability domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the characterization of graphs with maximum number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network transformations and bounding network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with randomly deleted edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894608 / 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: Q4435806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reliability-improving graph transformation with applications to network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for the characterization of graphs with a maximum number of spanning trees / rank
 
Normal rank

Latest revision as of 17:28, 1 July 2024

scientific article
Language Label Description Also known as
English
Undirected simple connected graphs with minimum number of spanning trees
scientific article

    Statements

    Identifiers