Potential energy principles in networked systems and their connections to optimization problems on graphs
DOI10.1007/S11590-014-0774-2zbMATH Open1317.90310OpenAlexW2011543076MaRDI QIDQ2018871FDOQ2018871
Authors: Alexander Veremyev, Vladimir 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
Recommendations
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
- A note on Fiedler vectors interpreted as graph realizations
- Convex optimization of graph Laplacian eigenvalues
- Graph theoretical approach. II: Determination of generalized forces for a class of systems consisting of particles and springs
- Application of graph theory to the determination of potential energy of systems consisting of rigid bodies and springs
optimizationgraph theorynetworksmaximum cliquealgebraic connectivitypotential energygraph Laplacian spectraMotzkin-Strauss formulation
Cites Work
- Statistical mechanics of complex networks
- Title not available (Why is that?)
- The Laplacian Spectrum of a Graph II
- Mining market data: a network approach
- Consensus and Cooperation in Networked Multi-Agent Systems
- Laplacian matrices of graphs: A survey
- Clique-detection models in computational biochemistry and genomics
- The Laplacian Spectrum of a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On colouring random graphs
- Title not available (Why is that?)
- Robustness and strong attack tolerance of low-diameter networks
- Old and new results on algebraic connectivity of graphs
- Large cliques in a power-law random graph
Cited In (2)
This page was built for publication: Potential energy principles in networked systems and their connections to optimization problems on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018871)
