Sufficient Conditions for Graphs to Be -Connected, Maximally Connected, and Super-Connected
| العنوان: | Sufficient Conditions for Graphs to Be -Connected, Maximally Connected, and Super-Connected |
|---|---|
| المؤلفون: | Zheng-Jiang Xia, Lutz Volkmann, Zhen-Mu Hong, Fu-Yuan Chen |
| المصدر: | Complexity, Vol 2021 (2021) |
| بيانات النشر: | Hindawi Limited, 2021. |
| سنة النشر: | 2021 |
| مصطلحات موضوعية: | Vertex (graph theory), Multidisciplinary, Article Subject, General Computer Science, Degree (graph theory), Spectral radius, 010102 general mathematics, MathematicsofComputing_GENERAL, 05C40, 05C50, QA75.5-76.95, 010103 numerical & computational mathematics, 01 natural sciences, Graph, Combinatorics, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Electronic computers. Computer science, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics, Connectivity, Complement (set theory), Mathematics |
| الوصف: | Let $G$ be a connected graph with minimum degree $\delta(G)$ and vertex-connectivity $\kappa(G)$. The graph $G$ is $k$-connected if $\kappa(G)\geq k$, maximally connected if $\kappa(G) = \delta(G)$, and super-connected (or super-$\kappa$) if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we show that a connected graph or a connected triangle-free graph is $k$-connected, maximally connected or super-connected if the number of edges or the spectral radius is large enough. Comment: 15 pages |
| وصف الملف: | text/xhtml |
| تدمد: | 1099-0526 1076-2787 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03afeb2d46d4d1432b20772835191cf3 https://doi.org/10.1155/2021/5588146 |
| حقوق: | OPEN |
| رقم الأكسشن: | edsair.doi.dedup.....03afeb2d46d4d1432b20772835191cf3 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 10990526 10762787 |
|---|