Question

how many of the following statements are correct
all cyclic graph are complete graph
all complete graph are cyclic graphs
all paths are bipartite
all cyclic graph are bipartite
there are cyclic graph which are complete
​

Answer 1

Given:

(i)- all cyclic graph are complete graph

(ii)- all complete graph are cyclic graphs

(iii)- all paths are bipartite

(iv)- all cyclic graph are bipartite

(v)- there are cyclic graph which are complete

To Find:

How many of the following statements are correct  ?

Solution:

( i )- Yes, all cyclic graph are complete graph.

(ii)-  Yes, all complete graph are cyclic graph.

(iii)-  Yes, all paths are bipartite .

(iv)-  Yes, cyclic graph are bipartite.

(v)- Yes, there are cyclic graph which are complete eg., Cycles in a set of 2n cycles which all contain the same set of edge.

Above given all statement are correct.