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

DOI10.1007/S10898-014-0141-YzbMATH Open1312.90085OpenAlexW2065547523MaRDI QIDQ486728FDOQ486728

Authors: Alexander Veremyev, Eduardo L. Pasiliao, Vladimir 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

Recommendations

• Robustness and strong attack tolerance of low-diameter networks
• Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
• On consensus of star-composed networks with an application of Laplacian spectrum
• Graphs with given diameter maximizing the algebraic connectivity
• On Laplacian spectra of parametric families of closely connected networks with application to cooperative control

zbMATH Keywords

algebraic connectivityLaplacian spectraoptimal attack-tolerant network topologies

Mathematics Subject Classification ID

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

Cites Work

• The Laplacian Spectrum of a Graph II
• Title not available (Why is that?)
• From Kuramoto to Crawford: Exploring the onset of synchronization in population of coupled oscillators
• Consensus and Cooperation in Networked Multi-Agent Systems
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Stability of multiagent systems with time-dependent communication links
• Laplacian matrices of graphs: A survey
• 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
• Title not available (Why is that?)
• Information Flow and Cooperative Control of Vehicle Formations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
• Robustness and strong attack tolerance of low-diameter networks
• Old and new results on algebraic connectivity of graphs
• Hop-constrained node survivable network design: An application to MPLS over WDM
• An exact algorithm for the maximum \(k\)-club problem in an undirected graph
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• A survey of graph laplacians
• Fragile networks: identifying vulnerabilities and synergies in an uncertain age
• Algebraic connectivity may explain the evolution of gene regulatory networks
• Sensor Networks With Random Links: Topology Design for Distributed Consensus
• Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
• Projected dynamical systems for international financial policy modeling and computation
• Title not available (Why is that?)
• Property \(P_{d,m}\) and efficient design of reliable networks
• Graphs with given diameter maximizing the algebraic connectivity
• Laplacian integral graphs in \(S(a, b)\)

Cited In (5)

• Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
• Toward optimal network topology design for fast and secure distributed computation
• Robustness and strong attack tolerance of low-diameter networks
• On consensus of star-composed networks with an application of Laplacian spectrum
• On Laplacian spectra of parametric families of closely connected networks with application to cooperative control

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486728)