The g-Component Edge Connectivity of Graphs
Axioms · 12.05.2026 · 15 (5) · 362
DOI: 10.3390/axioms15050362 ↗Kurz gefasst
Fachartikel in der Zeitschrift Axioms, online erschienen am 12.05.2026. Verfasst von He Li und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Natural Science Foundation of Qinghai province, National Natural Science Foundation of China.
Abstract (Originalsprache)
Connectivity is a classic measure that evaluates the fault tolerance of multiprocessor systems when processor failures occur. To better evaluate the reliability of multiprocessor systems, researchers have proposed many indicators based on connectivity with additional constraints, for example the number of components formed by removing an edge subset or a vertex subset. If the subgraph obtained from G by deleting an edge subset contains at least g components, the minimum size among all such edge subsets is denoted by the g-component edge connectivity of G. Regarding the g-component edge connectivity of many well-known networks, numerous results exist. However, we are particularly interested in general graphs. In this paper, we first establish basic properties of g-component edge connectivity and determine its exact value for complete graphs, paths, cycles and complete multipartite graphs. We then characterize graphs achieving a given g-component edge connectivity. Finally, we study three parameters related to g-component edge connectivity inspired by classical extremal problems.
Förderung
- Natural Science Foundation of Qinghai province
- National Natural Science Foundation of China
Zitieren
APA
Li, H., Zou, J., & Zhang, S. (2026). The g-Component Edge Connectivity of Graphs. Axioms, 15(5), 362. https://doi.org/10.3390/axioms15050362
Vancouver
Li H, Zou J, Zhang S. The g-Component Edge Connectivity of Graphs. Axioms. 2026;15(5):362. doi:10.3390/axioms15050362
BibTeX
@article{Li2026,
author = {Li, He and Zou, Jinyu and Zhang, Shumin},
title = {The g-Component Edge Connectivity of Graphs},
journal = {Axioms},
year = {2026},
volume = {15},
number = {5},
pages = {362},
doi = {10.3390/axioms15050362}
}
EUVIMED