Potential energy principles in networked systems and their connections to optimization problems on graphs
type: Item
instance of: scholarly article
title: Potential energy principles in networked systems and their connections to optimization problems on graphs
zbMATH Open document ID: 1317.90310
author: Alexander Veremyev
author: Vladimir Boginski
author: Eduardo L. Pasiliao
published in: Optimization Letters
publication date: 2015-03-25T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6419589
zbMATH Keywords: networks
zbMATH Keywords: potential energy
zbMATH Keywords: graph theory
zbMATH Keywords: optimization
zbMATH Keywords: maximum clique
zbMATH Keywords: Motzkin-Strauss formulation
zbMATH Keywords: graph Laplacian spectra
zbMATH Keywords: algebraic connectivity
MaRDI profile type: Publication
full work available at URL: s11590-014-0774-2
OpenAlex ID: W2011543076
cites work: Q4945528
cites work: Old and new results on algebraic connectivity of graphs
cites work: Statistical mechanics of complex networks
cites work: Mining market data: a network approach
cites work: Q3145799
cites work: Clique-detection models in computational biochemistry and genomics
cites work: On colouring random graphs
cites work: The Laplacian Spectrum of a Graph II
cites work: The Laplacian Spectrum of a Graph
cites work: Large Cliques in a Power-Law Random Graph
cites work: Laplacian matrices of graphs: A survey
cites work: Q4352274
cites work: Q4281312
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
cites work: Consensus and Cooperation in Networked Multi-Agent Systems
cites work: Robustness and Strong Attack Tolerance of Low-Diameter Networks
DOI: 10.1007/S11590-014-0774-2
description: scientific article; zbMATH DE number 6419589