On agglomeration-based rupture degree in networks and a heuristic algorithm
From MaRDI portal
Publication:6050471
DOI10.2478/ausi-2023-0010OpenAlexW4385665658MaRDI QIDQ6050471
Publication date: 18 September 2023
Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/ausi-2023-0010
graphsconnectivityvulnerabilityagglomerationcomplex networksnetwork design and communicationrupture degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vulnerability of complex networks
- A survey of integrity
- Tough graphs and Hamiltonian circuits.
- The average lower reinforcement number of a graph
- On the average lower bondage number of a graph
- VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS
- The rupture degree of trees
- COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS
- On Maximal Circuits in Finite Graphs
- On Combining the Methods of Link Residual and Domination in Networks
- SOME RESULTS FOR THE RUPTURE DEGREE
- Combining the Concepts of Residual and Domination in Graphs
- Global distribution center number of some graphs and an algorithm
- Weak-Rupture Degree of Graphs
- Relationships between vertex attack tolerance and other vulnerability parameters
- Neighbor Rupture Degree of Transformation Graphs Gxy−
- A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
- Rupture degree of graphs
- Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks
- Agglomeration-Based Node Importance Analysis in Wheel-Type Networks
This page was built for publication: On agglomeration-based rupture degree in networks and a heuristic algorithm