Regular Graph

Question

If a 2-regular graph G has a perfect matching then which of the following is/are true?
    S1: G is a cycle of even length
    S2: Chromatic number of G is 2
    S3: G is connected
    S4: Every component of G is an even cycle

Options-
A) S1,S2
B)S2,S4
C)S3,S4
D)S1,S4

Comments

@gurdeep @utkarsh S2 and S4 ok  , jst one doubt , G is a cycle of even length does it not mean that G has only one component of even length ?

---

yeah but S4 is more apt

Every component of G is an even cycle

it contains all the condition when component =1,2,3,4......N in which each component have even length

but S1 only applicable on one component of even length

---

every component of G is even cycle because  we have to take care ot 2 regular

so every component of G is single cycle of even length  , if you want to more than one in a sinlge component than it voilate the 2 degree conditation

G can have more than one component and every component is even cycle