The Gateway to Computer Science Excellence
0 votes
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

∑(i=1 to m)  eG(Ci−S) is

(1) ≤m

(2) ≥5m

(3) ≥3m
in Revision by (21 points) | 51 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,299 answers
104,989 users