1) Draw all connected graphs of order 5 in which the distance between every two distinct...

Transcribed Image Text:

1) Draw all connected graphs of order 5 in which the distance between every two distinct vertices is odd. 2) Construct a 3-regular graph H of minimum order containing P5 as an induced subgraph. 3) Give an example of three different (non-isomorphic) graphs of order 5 and size 5. 4) Show by some examples that a graph of order n and size n-1 need not be a tree. 1) Draw all connected graphs of order 5 in which the distance between every two distinct vertices is odd. 2) Construct a 3-regular graph H of minimum order containing P5 as an induced subgraph. 3) Give an example of three different (non-isomorphic) graphs of order 5 and size 5. 4) Show by some examples that a graph of order n and size n-1 need not be a tree.

Answer rating: 100% (QA)

1 The only possibility of such graph is k 5 complete graph of order 5 In a graph with 5 vertices If ... View the full answer