Name
Abstract | ||
|---|---|---|
A cyclic vertex-cut of a graph G is a vertex set S such that G-S is disconnected and at least two of its components contain cycles. If G has a cyclic vertex-cut, then it is said to be cyclically separable. For a cyclically separable graph G, the cyclic vertex-connectivity kappa(c)(G) is defined as the cardinality of a minimum cyclic vertex-cut. Let G(i) be a k(i)-regular (k(i) >= 2) and maximally connected graph with girth g(G(i)) >= 5 for i = 1,2. In this paper, we mainly prove that kappa(c)(K-m square G(2)) = 3k(2) + m - 3 for m >= 3 and kappa(c)(G(1)square G(2)) = 4k(1) + 4k(2) -8. In addition, we state sufficient conditions to guarantee kappa(c)(K-1 square G(2)) = 2 kappa(G(2)) . |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1080/17445760.2019.1659259 | INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS |
Keywords | DocType | Volume |
Cyclic vertex-cut, cyclic vertex-connectivity, cartesian product, maximally connected | Journal | 35 |
Issue | ISSN | Citations |
1 | 1744-5760 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dejin Qin | 1 | 0 | 0.34 |
| Yingzhi Tian | 2 | 0 | 2.37 |
| Laihuan Chen | 3 | 0 | 1.01 |
| Jixiang Meng | 4 | 353 | 55.62 |