Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
The k-Regular Edge Connectivity of Three Types of Regular Graphs. |
| Συγγραφείς: |
Wang, Li1 (AUTHOR) wanglimath@hpu.edu.cn, Lin, Liqing1 (AUTHOR) linliqing@home.hpu.edu.cn, Zhao, Yanxia1 (AUTHOR) zhaoyanxia001@126.com |
| Πηγή: |
International Journal of Foundations of Computer Science. Apr2026, Vol. 37 Issue 3, p413-427. 15p. |
| Θεματικοί όροι: |
*Fault tolerance (Engineering), Regular graphs, Graph connectivity, Graph theory |
| Περίληψη: |
Let G be a connected graph. The k-regular edge cut F of G is a subset of E (G) such that G − F is disconnected and each component is k-regular. The k-regular edge connectivity of G, denoted as λ k r (G) , is the minimum cardinality of a k-regular edge cut in G. It is a generalization of traditional connectivity, which has better fault tolerability. In this paper, we determine the k-regular edge connectivity of three categories of graphs, which are pancake graph P n , burnt pancake graph B P n and godan graph E A n . Moreover, λ k r (P n) = (n − k − 1) × n ! 2 for n ≥ 3 (1 ≤ k ≤ n − 2), λ k r (B P n) = (n − k) × 2 n − 1 × n ! for n ≥ 2 (1 ≤ k ≤ n − 1) and λ k r (E A n) = (n − k) × n ! 2 for n ≥ 3 (1 ≤ k ≤ n − 1) are shown. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |