Some Bounds for the Fragmentation Coefficient of Random Graphs
Graph fragmentation aims to find the smallest vertex subset whose removal breaks a graph into components of bounded size. While this problem has applications in network dismantling and combinatorics, theoretical bounds on optimal solutions remain limited. We derive rigorous bounds for several graph...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-03-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/14/3/208 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|