Potential energy principles in networked systems and their connections to optimization problems on graphs

DOI10.1007/s11590-014-0774-2zbMath1317.90310OpenAlexW2011543076MaRDI QIDQ2018871

Alexander Veremyev, Vladimir L. Boginski, Eduardo L. Pasiliao

Publication date: 25 March 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0774-2

zbMATH Keywords

optimizationnetworksgraph theorypotential energymaximum cliquealgebraic connectivitygraph Laplacian spectraMotzkin-Strauss formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Optimal partial clique edge covering guided by potential energy minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Old and new results on algebraic connectivity of graphs
• Laplacian matrices of graphs: A survey
• Clique-detection models in computational biochemistry and genomics
• Mining market data: a network approach
• Large Cliques in a Power-Law Random Graph
• Statistical mechanics of complex networks
• The Laplacian Spectrum of a Graph
• On colouring random graphs
• The Laplacian Spectrum of a Graph II
• Consensus and Cooperation in Networked Multi-Agent Systems
• Robustness and Strong Attack Tolerance of Low-Diameter Networks
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: Potential energy principles in networked systems and their connections to optimization problems on graphs