Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
type: Item
instance of: scholarly article
title: Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
zbMATH Open document ID: 1312.90085
author: Alexander Veremyev
author: Eduardo L. Pasiliao
author: Vladimir Boginski
published in: Journal of Global Optimization
publication date: 2015-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6387230
zbMATH Keywords: optimal attack-tolerant network topologies
zbMATH Keywords: Laplacian spectra
zbMATH Keywords: algebraic connectivity
MaRDI profile type: Publication
full work available at URL: s10898-014-0141-y
OpenAlex ID: W2065547523
cites work: Novel approaches for analyzing biological networks
cites work: From Kuramoto to Crawford: Exploring the onset of synchronization in population of coupled oscillators
cites work: An exact algorithm for the maximum \(k\)-club problem in an undirected graph
cites work: Q3546603
cites work: Q3918145
cites work: Old and new results on algebraic connectivity of graphs
cites work: Property Pd,m and efficient design of reliable networks
cites work: Information Flow and Cooperative Control of Vehicle Formations
cites work: Q5682350
cites work: Q3877805
cites work: Hop-constrained node survivable network design: An application to MPLS over WDM
cites work: The Laplacian Spectrum of a Graph II
cites work: The Laplacian Spectrum of a Graph
cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH
cites work: Coordination of groups of mobile autonomous agents using nearest neighbor rules
cites work: Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
cites work: Sensor Networks With Random Links: Topology Design for Distributed Consensus
cites work: Laplacian integral graphs in \(S(a, b)\)
cites work: Laplacian matrices of graphs: A survey
cites work: A survey of graph laplacians
cites work: Synchronization of Pulse-Coupled Biological Oscillators
cites work: Q4873761
cites work: Q4352274
cites work: Q4281312
cites work: Stability of multiagent systems with time-dependent communication links
cites work: Fragile networks: identifying vulnerabilities and synergies in an uncertain age
cites work: Projected dynamical systems for international financial policy modeling and computation
cites work: Algebraic connectivity may explain the evolution of gene regulatory networks
cites work: Consensus and Cooperation in Networked Multi-Agent Systems
cites work: Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
cites work: On clique relaxation models in network analysis
cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
cites work: Robustness and Strong Attack Tolerance of Low-Diameter Networks
cites work: Graphs with given diameter maximizing the algebraic connectivity
DOI: 10.1007/S10898-014-0141-Y
description: scientific article; zbMATH DE number 6387230