Heuristic maximization of the number of spanning trees in regular graphs
DOI10.1016/J.JFRANKLIN.2006.03.012zbMATH Open1142.90041OpenAlexW2066194933MaRDI QIDQ855940FDOQ855940
Authors: Jarosław Arabas, Błaẓej Sawionek, Jacek 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
Recommendations
- Heuristic approaches to the maximization of the number of spanning trees in regular graphs
- On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
- On the number of spanning trees in directed circulant graphs
- On the characterization of graphs with maximum number of spanning trees
- Maximizing the number of spanning trees of networks based on cycle basis representation
evolutionary algorithmspanning treediscrete optimizationregular graphs\(t\)-optimal graph2-optimal algorithm
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Association schemes, strongly regular graphs (05E30)
Cites Work
- Title not available (Why is that?)
- A new technique for the characterization of graphs with a maximum number of spanning trees
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Synthesis of reliable networks - a survey
- Graph theoretic reliability analysis for the Boolean n cube networks
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- Maximizing spanning trees in almost complete graphs
- On the existence of uniformly optimally reliable networks
- On the number of spanning trees in directed circulant graphs
- On the number of spanning trees of circulant graphs
- Title not available (Why is that?)
- Counting trees in directed regular multigraphs
- Heuristic approaches to the maximization of the number of spanning trees in regular graphs
- On the design of reliable networks
- On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
- Title not available (Why is that?)
Cited In (4)
- Maximizing the number of spanning trees of networks based on cycle basis representation
- Heuristic approaches to the maximization of the number of spanning trees in regular graphs
- Maximizing spanning trees in almost complete graphs
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
This page was built for publication: Heuristic maximization of the number of spanning trees in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855940)
