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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.08.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054979463 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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

    Undirected simple connected graphs with minimum number of spanning trees (English)
    0 references
    23 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    undirected simple graph
    0 references
    spanning tree
    0 references
    enumeration
    0 references
    0 references