Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions
Given a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1. In general, determining the k-component order edge connectivit...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2025-01-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol12/iss1/1/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|