Advertisement
Published in:
2010 | OriginalPaper | Chapter
Cyclic Vertex Connectivity of Star Graphs
Authors : Zhihua Yu, Qinghai Liu, Zhao Zhang
Published in: Combinatorial Optimization and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
For a connected graph
G
, a vertex subset
F
⊂
V
(
G
) is a cyclic vertex-cut of
G
if
G
−
F
is disconnected and at least two of its components contain cycles. The cardinality of a minimum cyclic vertex-cut of
G
, denoted by
κ
c
(
G
), is the cyclic vertex-connectivity of
G
. In this paper, we show that for any integer
n
≥ 4, the
n
-dimensional star graph
SG
n
has
κ
c
(
SG
n
) = 6(
n
− 3).