3
$\begingroup$

Suppose that the vertex set of a graph G is a (finite) set of integers. Two vertices x and y are adjacent if x + y is odd. To which well-known class of graphs is G a member?

  • 1
    It's a bipartite graph. Two numbers are connected if and only if one is odd and the other is even. – 2017-02-05
  • 0
    Thank you sir.. Sir Can you please draw the graph?? – 2017-02-05
  • 0
    I cannot draw the graph without knowing the set of vertices. – 2017-02-05
  • 0
    Then what will be it's answer?? – 2017-02-06

1 Answers 1

1

I believe it's bipartite. odd numbers connect to evens but not to other odds, and vice versa. Take the integers 1 to 10 and draw the connections.

  • 0
    Thank you sir.. Sir Can you please draw the graph?? – 2017-02-05
  • 0
    Not sir -- Victoria is a woman's name just FYI. I suggest you draw the graph yourself. Start with the numbers 1 to 10. 1 connects with 2,4,6,8, 10 but NOT with 3,5,7,9. 2 connects with 1,3,5,7,9, but NOT with 4,6,8,10, and so on. – 2017-02-05
  • 0
    Sorry Mam.. And thank you for your suggestion.. – 2017-02-05
  • 0
    Even more: it is complete bipartite. – 2017-02-06