Scribd
Upload
10 views4 pages

Assignment On JAVA

The document contains a series of assignments related to graph theory, including questions on maximum vertices in simple graphs, degree sequences, simple graph combinations, bipartite graphs, planar graph properties, Euler and Hamiltonian graphs, and minimum spanning trees. It requires proving certain properties of planar graphs and checking graph isomorphism. Additionally, it involves finding chromatic numbers and identifying non-planar graphs.

Uploaded by

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

Assignment On JAVA

The document contains a series of assignments related to graph theory, including questions on maximum vertices in simple graphs, degree sequences, simple graph combinations, bipartite graphs, planar graph properties, Euler and Hamiltonian graphs, and minimum spanning trees. It requires proving certain properties of planar graphs and checking graph isomorphism. Additionally, it involves finding chromatic numbers and identifying non-planar graphs.

Uploaded by

Zaid Z.Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

CSE208 [DMS]

Assignment [Module4]

Q.1: Find the maximum number of vertices in a simple graph with 10 edges
where degree of each vertex is at least 3.

Q.2: Check whether a simple graph exits for the given degree sequences or
not
a) 6 5 5 4 3 3 2 2 2
b) 6 6 6 6 4 3 3 0
c) 4,4,3,3,2,2
d) 5,3,3,3,2,2,1,1

Q.3: Find the number of simple graphs possible with 6 vertices and 5 edges.

Q.4: Check whether the given graph is Bi-partite or not

Q.5: Observe the given sequences and predict the nature of walk in each case-
Q.6: Prove the following for planar Graph:
(a) If G is a connected planar graph with V vertices, E edges and r regions,
then the number r of the regions of G is given b r =E−V +2 .
(b) If G is a planar graph, with v ≥ 3, then e ≤ 3 p ─ 6 .
(c) if G is a bipartite (Cycle of length 3 is not possible), then we have e ≤ 2 v ─ 4.

Q.7: Find which of the following graphs are Euler, semi Euler graphs.

Q.8 Check whether the following graphs are Isomorphic or not

a)

b)
c)

Q.9 Check if the given graph is Hamiltonian graph.

Q.10 Check if the given graph is Hamiltonian graph.

Q.11 Justify, whether the following graph G1 and G2 is Euler Graph? If yes
write the sequence of Eulerian circuit.
Q12. Find the minimum spanning tree of the given graph using Kruskal
Algorithm. Also find the total cost of the minimum spanning tree.

Q13. Find the Chromatic number of the given graph.

Q14. Show that K5 and K33 is a non-planar Graph

***************************************************

You might also like