Professional Documents
Culture Documents
IN 3-CONNECTED GRAPHS
Toshimasa Watanabe, Satoshi Kajita and Kenji Onaga
Abstract
A vertex cover of a graph G=(V,E) is a subset N of V
1. Introduction
cover of a graph G=(V,E) is a subset N
of V such that each element of E is incident upon
some element of N, where V and E are the sets of
vertices and of e d g e s of G , respectively. A
connected vertex cover of a graph G is a vertex
cover of G such that the subgraph G[N] induced by
N of G is a connected graph. The minimum vertex
cover problem (VCP for short) is the problem of
finding a vertex cover of minimum cardinality, and
the minimum connected vertex cover p r o b l e m
(CVCP for short) is similarly defined.
The minimum vertex cover problem is one of
basic problems in graph and combinatorial theory,
and various characterizations and algorithms have
been given. Concerning NP-completeness, VCP for
general graphs [2], planar graphs with maximum
vertex degree at most 3 [2], cubic planar graphs
[ l o ] , cubic regular planar 3-connected graph [8],
have been shown to be NP-complete. As for the
polynomial-time solvability of VCP, a minimum
vertex cover N can be obtained in O(IVI+IEI) time
for series-parallel graphs [1,6], in 0 (IV152) time
for bipartite graphs [4]. On the other hand, as for
NP-completeness of CVCP, CVCP for planar graph
with maximum vertex degree at most 4 has been
shown to be NP-complete [2]. NP-completeness of
C V C P for 3-connected planar graphs has been
obtained in [12]. As for the polynomial-time
solvability, [lo] showed that a minimum connected
vertex cover of a graph with maximum vertex
degree a t most 3 is polynomial-time solvable.
Time complexity analysis of VCP and CVCP for 3A vertex
2.3-Connected Graphs
The c o n n e c t i v i t y K ( G ) of a graph G is the
minimum number of vertices whose deletion from G
disconnected it or result in a single vertex. A graph
G is called a k - c o n n e c t e d graph if K ( G ) > k . We
denote an elementary cycle of length n by C,. A
wheel of order n, 1123, is the graph obtained from a
cycle Cn by adding one new vertex vo and joining
v o to each vertex of Cn with an edge. We denote this
wheel by W n + l = K I + C n . We refer to Cn as the r i m ,
and to vo as the h u b of W,. The edges joining v o
and vertices of Cn are called the s p o k e s . F i g . l ( a )
shows a wheel W g . A graph G is a 3-connected
graph if and only if G is either a wheel or a graph
obtained from a wheel by repeating the following
Proposition
1.
If
is
planar
then
the
1018
is 0 (lV13/2).
T h e o r e m 8 . Let G be a cubic planar quasiwheel in which the hub-tree is a path (see Fig.3). If
[ l N ~ l , l N 2 l J < r + lthen min[lN11,1N21) is the cardinality
of a minimum vertex cover of G , and N1, N2 can be
obtained in 0(IV15/2) time.
7. Concluding Remarks
We discussed time complexity analysis of the
minimum vertex cover and minimum connected
vertex c o v e r problems for 3-connected graphs.
Time complexity analysis of the minimum vertex
cover problem for quasi-wheel graphs and the Type
2 detection problem is left for future research.
Acknowledgements
The research of T.Watanabe is partly supported by
the Grant in Aid for Scientific Research of the
Ministry of Education, Science and Culture of Japan
under
Grant:
(A)
02302047;
by
the
Telecommunications
Advancement
Foundation
(TAF), Tokyo, Japan: and by CSK Research Grant for
Information Communucation, Tokyo, Japan.
References
and Proskuriwski,A., Linear-time
algorithms for NP-hard problems restricted to
partial k-trees, Discrete Applied Mathematics, 23
(1989), 11-24.
[2]Garey,M.R. and Johnson,D.S., T h e rectilinear
steiner tree problem is NP-complete, SIAM J.
Appl. M a t h , 32 (1977), 826-834.
[3]Garey,M.R. and Johnson,D.S., Computers and
Intractability: A Guide to the Theory of NPcompleteness, Freeman & Sons, San Francisco,
CA, 1978.
[ I]Arnborg,S.
2'
1019
(4
(b)
(1)
(2)
1020