Scribd
Upload
392 views

Assignment 3 PDF

This document outlines an assignment in discrete mathematical structures for third semester B.Tech students. The assignment contains 10 questions related to graph theory topics like drawing graphs with specified properties, listing subgraphs, determining numbers of vertices and edges, defining Hamiltonian and Euler circuits and providing examples, applying Dijkstra's algorithm and determining shortest paths, checking graph isomorphism, and finding chromatic polynomials and numbers. Students are asked to complete problems involving graph drawings, definitions, examples, algorithms, and polynomial evaluations.

Uploaded by

RAHUL DHANOLA
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
392 views

Assignment 3 PDF

This document outlines an assignment in discrete mathematical structures for third semester B.Tech students. The assignment contains 10 questions related to graph theory topics like drawing graphs with specified properties, listing subgraphs, determining numbers of vertices and edges, defining Hamiltonian and Euler circuits and providing examples, applying Dijkstra's algorithm and determining shortest paths, checking graph isomorphism, and finding chromatic polynomials and numbers. Students are asked to complete problems involving graph drawings, definitions, examples, algorithms, and polynomial evaluations.

Uploaded by

RAHUL DHANOLA
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Department of Mathematics Assignment 3

UNIVERSITY OF PETROLEUM & ENERGY STUDIES, DEHRADUN


Program B.Tech (All SoCSBranches) Semester III
Course Discrete Mathematical Structures Course Code CSEG2006

1. Draw a graph with the specified properties or give reason to show that no such graph exists.
i. A graph with four vertices of degree 1,1,2 and 3
ii. A graph with four vertices of degree 1,1,3 and 3
iii. A simple graph with four vertices of degree 1,1,3 and 3
2. List all the subgraphs of the graph G with vertex set and edge set , where the endpoints
of are and , the end points of are and , and is a loop at .
3. How many vertices and edges do the following graphs have ?
(a) Kn (b) Cn (c) Wn (d) Km,n (e) Qn
4.Define Hamiltonian circuit and Euler circuit. Give an example of each of the following graphs
i. N-Cube (Q3) v. Wheels graph (W4, W5)
ii. Complete Bipartite vi. Hamiltonian, but non- Eulerian
iii. Regular graph of degree 4 vii. Eulerian but non-Hamiltonian.
iv. Cycles graph (C4, C5) viii. Eulerian as well as Hamiltonian.
5. Give an example of each of the following graph containg
i. an Euler circuit but not Hamiltonian cycle, ii. A Hamiltonian cycle but not an Eulerian circuit
iii. an Eulerian circuit as well as Hamiltonian cycle iv. an Eulerian circuit and a Hamiltonian cycle that
are distinct.
6. Using Dijkstra’s algorithm, determine the length of the shortest path and hence the shortest path in the
graph from P to Q

7.The distance between the different cities in New Jersey as shown in the figure. Determine the shortest
route between Newark and Cape May, using these roads.
Department of Mathematics Assignment 3

UNIVERSITY OF PETROLEUM & ENERGY STUDIES, DEHRADUN


Program B.Tech (All SoCSBranches) Semester III
Course Discrete Mathematical Structures Course Code CSEG2006

8. Define Isomorphism between two graphs and check whether the following graphs are isomorphic or not.

9. Using the decomposition theorem, determine the chromatic polynomial, and hence the chromatic number
of the graph as shown below.

10. Explain why each of the following polynomials can not be a chromatic polynomial
(a) λ3 + 5 λ2 – 3 λ + 5 (b) λ4 + 3 λ3 – 3 λ2

You might also like