Opening book details…
Can I read The Cubic Graphs with Finite Cyclic Vertex Connectivity Larger Than Girth on EtoBox?
The Cubic Graphs with Finite Cyclic Vertex Connectivity Larger Than Girth by Jun Liang; Dingjun Lou; Zan-Bo Zhang is a Computer Science article available to read on EtoBox.
What is The Cubic Graphs with Finite Cyclic Vertex Connectivity Larger Than Girth about?
Cyclic (vertex and edge) connectivity is an important concept in graphs. While cyclic edge connectivity ( c λ ) has been studied for many years, the study at cyclic vertex connectivity ( c κ ) is still at the initial stage. And c κ seems to be more complicated than c λ . We have got a sufficient condition that ν ( G ) ≥ 2 g ( k − 1 ) for c κ ≠ ∞ . On the other hand, if ν ( G ) < 2 g ( k − 1 ) , then we have c κ = ∞ , or c κ ≤ ( k − 2 ) g , or ( k − 2 ) g < c κ < ∞ . So characterizing all the k -regular graphs with ( k − 2 ) g < c κ < ∞ is helpful to design an efficient algorithm for c κ . Hence, we characterize all 38 cubic graphs with g < c κ < ∞ and prove that c κ = g + 1 .
Who reads The Cubic Graphs with Finite Cyclic Vertex Connectivity Larger Than Girth?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Jun Liang; Dingjun Lou; Zan-Bo Zhang
- Publisher
- Elsevier BV
- Published
- 2021
- Language
- EN
- Field
- Computer Science (Physical Sciences)