Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
From MaRDI portal
(Redirected from Publication:486728)
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
Cites work
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 3730180 (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 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- A survey of graph laplacians
- Algebraic connectivity may explain the evolution of gene regulatory networks
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus and Cooperation in Networked Multi-Agent Systems
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Fragile networks: identifying vulnerabilities and synergies in an uncertain age
- From Kuramoto to Crawford: Exploring the onset of synchronization in population of coupled oscillators
- Graphs with given diameter maximizing the algebraic connectivity
- Hop-constrained node survivable network design: An application to MPLS over WDM
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Information Flow and Cooperative Control of Vehicle Formations
- Laplacian integral graphs in \(S(a, b)\)
- Laplacian matrices of graphs: A survey
- Novel approaches for analyzing biological networks
- Old and new results on algebraic connectivity of graphs
- On clique relaxation models in network analysis
- Projected dynamical systems for international financial policy modeling and computation
- Property \(P_{d,m}\) and efficient design of reliable networks
- Robustness and strong attack tolerance of low-diameter networks
- Sensor Networks With Random Links: Topology Design for Distributed Consensus
- Stability of multiagent systems with time-dependent communication links
- Synchronization of Pulse-Coupled Biological Oscillators
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
Cited in
(5)- 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
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
- 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)
