Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra

DOI10.1007/s10898-014-0141-yzbMath1312.90085OpenAlexW2065547523MaRDI QIDQ486728

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

Publication date: 16 January 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0141-y

zbMATH Keywords

algebraic connectivityLaplacian spectraoptimal attack-tolerant network topologies

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26)

Related Items (1)

On Laplacian spectra of parametric families of closely connected networks with application to cooperative control

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
• Graphs with given diameter maximizing the algebraic connectivity
• Old and new results on algebraic connectivity of graphs
• Laplacian integral graphs in \(S(a, b)\)
• Hop-constrained node survivable network design: An application to MPLS over WDM
• Laplacian matrices of graphs: A survey
• From Kuramoto to Crawford: Exploring the onset of synchronization in population of coupled oscillators
• An exact algorithm for the maximum \(k\)-club problem in an undirected graph
• Algebraic connectivity may explain the evolution of gene regulatory networks
• On clique relaxation models in network analysis
• Novel approaches for analyzing biological networks
• Synchronization of Pulse-Coupled Biological Oscillators
• The Laplacian Spectrum of a Graph
• The Laplacian Spectrum of a Graph II
• Sensor Networks With Random Links: Topology Design for Distributed Consensus
• Consensus and Cooperation in Networked Multi-Agent Systems
• A survey of graph laplacians
• Fragile networks: identifying vulnerabilities and synergies in an uncertain age
• Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Information Flow and Cooperative Control of Vehicle Formations
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Stability of multiagent systems with time-dependent communication links
• Property P_d,m and efficient design of reliable networks
• Robustness and Strong Attack Tolerance of Low-Diameter Networks
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra