Potential energy principles in networked systems and their connections to optimization problems on graphs
From MaRDI portal
Publication:2018871
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
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 510844 (Why is no real title available?)
- scientific article; zbMATH DE number 1054729 (Why is no real title available?)
- scientific article; zbMATH DE number 1424314 (Why is no real title available?)
- Clique-detection models in computational biochemistry and genomics
- Consensus and Cooperation in Networked Multi-Agent Systems
- Laplacian matrices of graphs: A survey
- Large cliques in a power-law random graph
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Mining market data: a network approach
- Old and new results on algebraic connectivity of graphs
- On colouring random graphs
- Robustness and strong attack tolerance of low-diameter networks
- Statistical mechanics of complex networks
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
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)