Question
State whether the following statements are true or false. Justify your answers with a short proof or a counterexamp
i) There exists an 8-vertex graph with three vertices of degree 3, four vertices of degree 2 and one vertex of degree 1
ii) The neighbour of every leaf is a cut-vertex.
iii) Every line graph of a bipartite graph is 2-colourable
iv) is a graphic sequence then so is
v)
vi) A Hamiltonian graph has no cut-vertices.
vii) The Petersen graph is 3-critical.
viii) An n-vertex star has no perfect matching for n ≥ 3.
ix) The crossing number of K3,3 is 2.
x) If f and g are two flows on a network N, then max is also a flow.
Answer :
Word Count : 388
________ ____ _____ _______ ___ ___ _____ _______ ____ ____ ___ ________.
__________ _________ _________ ____ ________ ________ ________ ________ _________ __________ _______.
________ ____ _____ ____ __________.
________ ______ ________ ____ _______ _________ __________ ______ ___ _______ _______ ________.
____ __________ ______ ___ ___ _________ __________.
__________ ____ ______ ___ ________ __________ ___ ________ ________ ________.
____ ____ _______ _____ ___ _________.
______ ________ ___ ____ ____ ___ _______ _______ ________ ___.
_______ ________ _________ ________ ____.
_____ _________ ______ ______ ______.
______ ________ __________ ______ _____ _______ ___ ___ __________.
___ _________ _____ ______ _______ _______ _______ ___.
_____ ___ ___ ___ ____.
_________ ____ ________ ____ ________ __________ _________ __________ ______ ______.
_____ ______ ________ _________ ____ _____ _____ _______.
________ ____ ______ _________ ______ ____ ______ __________ _____ ________ _______.
__________ _____ ________ ____ _________ ______ _________ _____ _____ ___.
____ ______ _________ ______ __________.
_________ ______ _______ __________ __________ _______ ____.
______ _______ ________ ______ __________ ____.
____ ____ ____ _________ ______.
____ ______ ________ _________ ________ _________.
________ ____ ________ ___ _________.
________ ______ __________ ______ ______ __________.
_________ _________ ______ __________ _______.
__________ __________ __________ _________ ______.
____ ___ _____ _______ ____ ___.
____ ________ ________ _________ ___ ______ ______ _____.
__________ _______ _________ ___ _______ ______ __________ ____ _________.
____ _____ _________ _________ _________ ____.
_______ ______ ____ ___ __________.
______ ____ ____ __________ __________ ______ _______ ________ ______ _____ ______ ____.
____ _______ _____ ___ _____ ____ _________ ______ _________ ______ ________ __________.
___ _____ ____ _______ ________ ____ ___ __________ _________ ______ ______ _________.
___.
Skip in 10
i) True. Degrees: $3,3,3,2,2,2,2,1$ sum to $18$ (even) and Havel–Hakimi succeeds: $[3,3,3,2,2,2,2,1]\to[2,2,2,2,1,1]\to[2,1,1,1,1]\to[1,1,0,0]\to[0,0,0,0]$. Hence the sequence is graphic, so such an 8-vertex graph exists. ii) False. Counterexample: $K_2$ (two vertices joined by an edge). Each vertex is a leaf and the neighbour of a leaf is the other vertex; removing that neighbour leaves one vertex (still one component), so it is not a cut-vertex. (In any connected graph with $\ge3$ vertices the neighbour of a leaf is a cut-vertex, but the statement as written for all graphs is false.) iii) False. Counterexample: take the star $K_{1,3}$ (which is bipartite). Its line graph is $K_3$, which is not 2-colourable. iv) False. If $(d_1,\dots,d_n)$ is graphic then $(d_1+1,\dots,d_n+1)$ need
____ ___ ____ ______ _______ ________ _______.________ ____ _____ _______ ___ ___ _____ _______ ____ ____ ___ ________.
__________ _________ _________ ____ ________ ________ ________ ________ _________ __________ _______.
________ ____ _____ ____ __________.
________ ______ ________ ____ _______ _________ __________ ______ ___ _______ _______ ________.
____ __________ ______ ___ ___ _________ __________.
__________ ____ ______ ___ ________ __________ ___ ________ ________ ________.
____ ____ _______ _____ ___ _________.
______ ________ ___ ____ ____ ___ _______ _______ ________ ___.
_______ ________ _________ ________ ____.
_____ _________ ______ ______ ______.
______ ________ __________ ______ _____ _______ ___ ___ __________.
___ _________ _____ ______ _______ _______ _______ ___.
_____ ___ ___ ___ ____.
_________ ____ ________ ____ ________ __________ _________ __________ ______ ______.
_____ ______ ________ _________ ____ _____ _____ _______.
________ ____ ______ _________ ______ ____ ______ __________ _____ ________ _______.
__________ _____ ________ ____ _________ ______ _________ _____ _____ ___.
____ ______ _________ ______ __________.
_________ ______ _______ __________ __________ _______ ____.
______ _______ ________ ______ __________ ____.
____ ____ ____ _________ ______.
____ ______ ________ _________ ________ _________.
________ ____ ________ ___ _________.
________ ______ __________ ______ ______ __________.
_________ _________ ______ __________ _______.
__________ __________ __________ _________ ______.
____ ___ _____ _______ ____ ___.
____ ________ ________ _________ ___ ______ ______ _____.
__________ _______ _________ ___ _______ ______ __________ ____ _________.
____ _____ _________ _________ _________ ____.
_______ ______ ____ ___ __________.
______ ____ ____ __________ __________ ______ _______ ________ ______ _____ ______ ____.
____ _______ _____ ___ _____ ____ _________ ______ _________ ______ ________ __________.
___ _____ ____ _______ ________ ____ ___ __________ _________ ______ ______ _________.
___.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.