A generalization of Boesch's theorem (Q409456): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C90 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6023653 / rank
 
Normal rank
Property / zbMATH Keywords
 
network reliability
Property / zbMATH Keywords: network reliability / rank
 
Normal rank
Property / zbMATH Keywords
 
Boesch's theorem
Property / zbMATH Keywords: Boesch's theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
\(t\)-optimal graphs
Property / zbMATH Keywords: \(t\)-optimal graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
spanning trees
Property / zbMATH Keywords: spanning trees / rank
 
Normal rank
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.2011.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967587966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of uniformly optimally reliable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing spanning trees in almost complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / 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: On the characterization of graphs with maximum number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949882 / 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
Property / cites work
 
Property / cites work: Maximizing the number of spanning trees in a graph with n nodes and m edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Boesch's conjecture / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:23, 5 July 2024

scientific article
Language Label Description Also known as
English
A generalization of Boesch's theorem
scientific article

    Statements

    Identifiers