115 views
Let G be a connected 3 - regular graph. Each edge of G lies on some cycle. Let S⊆V and C1,C2,…,Cm,m=Codd(G−S), be the odd component of G−S. Let  eG(Ci,S) denote the number of edges with one- end in Ci and the other in S. Then eG(Ci,S) is

(A) Even

(B) Odd

(C) Cannot say
in Revision | 115 views