Heuristic maximization of the number of spanning trees in regular graphs
type: Item
instance of: scholarly article
title: Heuristic maximization of the number of spanning trees in regular graphs
zbMATH Open document ID: 1142.90041
author: Jarosław Arabas
author: Błaẓej Sawionek
author: Jacek Wojciechowski
published in: Journal of the Franklin Institute
publication date: 2006-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 05E30
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5078295
zbMATH Keywords: \(t\)-optimal graph
zbMATH Keywords: regular graphs
zbMATH Keywords: spanning tree
zbMATH Keywords: discrete optimization
zbMATH Keywords: evolutionary algorithm
zbMATH Keywords: 2-optimal algorithm
MaRDI profile type: Publication
full work available at URL: j.jfranklin.2006.03.012
OpenAlex ID: W2066194933
cites work: Q4887741
cites work: Graph theoretic reliability analysis for the Boolean n cube networks
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: A new technique for the characterization of graphs with a maximum number of spanning trees
cites work: On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
cites work: On the design of reliable networks
cites work: On the number of spanning trees in directed circulant graphs
cites work: Counting trees in directed regular multigraphs
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: Q3693257
cites work: Q3907599
cites work: On the number of spanning trees of circulant graphs
cites work: Heuristic approaches to the maximization of the number of spanning trees in regular graphs
cites work: Synthesis of reliable networks - a survey
DOI: 10.1016/J.JFRANKLIN.2006.03.012
description: scientific article; zbMATH DE number 5078295