A generalization of Boesch's theorem
type: Item
instance of: scholarly article
title: A generalization of Boesch's theorem
zbMATH Open document ID: 1235.90055
author: Maolin Hu
author: Yongxi Cheng
author: Weidong Xu
published in: Discrete Mathematics
publication date: 2012-04-13T00:00:00Z
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6023653
zbMATH Keywords: network reliability
zbMATH Keywords: Boesch's theorem
zbMATH Keywords: \(t\)-optimal graphs
zbMATH Keywords: spanning trees
MaRDI profile type: Publication
full work available at URL: j.disc.2011.12.001
OpenAlex ID: W1967587966
cites work: Q4770409
cites work: On the existence of uniformly optimally reliable networks
cites work: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
cites work: Maximizing spanning trees in almost complete graphs
cites work: Parallel concepts in graph theory
cites work: Q4894608
cites work: A certain polynomial of a graph and graphs with an extremal number of trees
cites work: On the characterization of graphs with maximum number of spanning trees
cites work: Q4949882
cites work: A new technique for the characterization of graphs with a maximum number of spanning trees
cites work: Maximizing the number of spanning trees in a graph with n nodes and m edges
cites work: A proof of Boesch's conjecture
DOI: 10.1016/J.DISC.2011.12.001
description: scientific article; zbMATH DE number 6023653