Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
250 views4 pages

Discrete Structure Assignment#2

The document contains instructions for 12 questions on a discrete structures assignment. The questions cover topics such as determining if graphs are isomorphic, chromatic numbers of graphs, bipartite graphs, degrees of vertices, Hamiltonian and Euler circuits/paths, dual graphs, chromatic numbers, dense vs sparse graphs, pendent vertices, graph types, and minimum spanning trees.

Uploaded by

Ali Razzaq
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
250 views4 pages

Discrete Structure Assignment#2

The document contains instructions for 12 questions on a discrete structures assignment. The questions cover topics such as determining if graphs are isomorphic, chromatic numbers of graphs, bipartite graphs, degrees of vertices, Hamiltonian and Euler circuits/paths, dual graphs, chromatic numbers, dense vs sparse graphs, pendent vertices, graph types, and minimum spanning trees.

Uploaded by

Ali Razzaq
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Discrete Structure Assignment # 2

Submission date: 23rd June 2021

1. Are following graphs isomorphic or not? Clearly mention degrees of every vertex.

2. Following graphs are not isomorphic but have vertex with same degrees. State any valid reason
why is it obvious that they are not isomorphic.

3. Determine the chromatic number for Q3, W7, K3,2 . (NOTE: K3,2 is a bipartite graph with V1(2 nodes)
/ V2(3 nodes) and nodes are completely connected).
4. Are C6, C7 and W3 bipartite? (Note: C6 is a cyclic graph with 6 nodes).
5. Determine degree for the following graphs. [In-degree is denoted as deg- and out-degree as
deg+]

6. Determine and identify which of the following graphs have Hamiltonian and/or Euler circuit or
path or neither or both.

7. Transform the following map into its corresponding dual graph and determine its chromatic
number.

8. The chromatic number for K2,3, W9, C7 and Q8 is , , and respectively.

9. Determine given graphs are dense or sparse?


10. Determine which of the following graphs have Pendent vertices.

11. Determine the type of each of following graph.

12. Find out minimum spanning tree of following graph.

You might also like