The m-Component Connectivity of Leaf-Sort Graphs
Mathematics · 26.01.2024 · 12 (3) · 404
DOI: 10.3390/math12030404 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 26.01.2024. Verfasst von Shiying Wang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Shanxi Provincial Fundamental Research Program of China, Shanxi Province Graduate Research Innovation Project.
Abstract (Originalsprache)
Connectivity plays an important role in measuring the fault tolerance of interconnection networks. As a special class of connectivity, m-component connectivity is a natural generalization of the traditional connectivity of graphs defined in terms of the minimum vertex cut. Moreover, it is a more advanced metric to assess the fault tolerance of a graph G. Let G=(V(G),E(G)) be a non-complete graph. A subset F(F⊆V(G)) is called an m-component cut of G, if G−F is disconnected and has at least m components (m≥2). The m-component connectivity of G, denoted by cκm(G), is the cardinality of the minimum m-component cut. Let CFn denote the n-dimensional leaf-sort graph. Since many structures do not exist in leaf-sort graphs, many of their properties have not been studied. In this paper, we show that cκ3(CFn)=3n−6 (n is odd) and cκ3(CFn)=3n−7 (n is even) for n≥3; cκ4(CFn)=9n−212 (n is odd) and cκ4(CFn)=9n−242 (n is even) for n≥4.
Förderung
- National Natural Science Foundation of China
- Shanxi Provincial Fundamental Research Program of China
- Shanxi Province Graduate Research Innovation Project
Zitieren
APA
Wang, S., Li, H., & Zhao, L. (2024). The m-Component Connectivity of Leaf-Sort Graphs. Mathematics, 12(3), 404. https://doi.org/10.3390/math12030404
Vancouver
Wang S, Li H, Zhao L. The m-Component Connectivity of Leaf-Sort Graphs. Mathematics. 2024;12(3):404. doi:10.3390/math12030404
BibTeX
@article{Wang2024,
author = {Wang, Shiying and Li, Hongmei and Zhao, Lina},
title = {The m-Component Connectivity of Leaf-Sort Graphs},
journal = {Mathematics},
year = {2024},
volume = {12},
number = {3},
pages = {404},
doi = {10.3390/math12030404}
}
EUVIMED