Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity
For an integer ℓ ≥ 2, the ℓ-component connectivity of a graph G, denoted by κ<sub>ℓ</sub>(G), is the minimum number of vertices whose removal from G results in a disconnected graph with at least ℓ components or a graph wit...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8764351/ |