Heuristic maximization of the number of spanning trees in regular graphs

DOI10.1016/j.jfranklin.2006.03.012zbMath1142.90041OpenAlexW2066194933MaRDI QIDQ855940

Jarosław Arabas, Błaẓej Sawionek, Jacek M. Wojciechowski

Publication date: 7 December 2006

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2006.03.012

zbMATH Keywords

regular graphsspanning treeevolutionary algorithmdiscrete optimization\(t\)-optimal graph2-optimal algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Association schemes, strongly regular graphs (05E30) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting trees in directed regular multigraphs
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• A new technique for the characterization of graphs with a maximum number of spanning trees
• Heuristic approaches to the maximization of the number of spanning trees in regular graphs
• On the number of spanning trees in directed circulant graphs
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• On the design of reliable networks
• On the number of spanning trees of circulant graphs
• Synthesis of reliable networks - a survey
• Graph theoretic reliability analysis for the Boolean n cube networks
• Maximizing spanning trees in almost complete graphs
• On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
• On the existence of uniformly optimally reliable networks

This page was built for publication: Heuristic maximization of the number of spanning trees in regular graphs