Scribd
Upload
11 views2 pages

IGT Assignment 2 1

This document outlines an assignment for the B.Tech course 'Introductory Graph Theory' at SIKSHA 'O' ANUSANDHAN University, focusing on trees and distance. It includes various questions related to graph theory concepts such as diameter, radius, spanning trees, and properties of trees, along with methods like Edge Contraction and Matrix Tree Computation. The assignment carries a weightage of 10 marks and aims to assess students' understanding and application of graph theory principles.

Uploaded by

sahoosubham750
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
11 views2 pages

IGT Assignment 2 1

This document outlines an assignment for the B.Tech course 'Introductory Graph Theory' at SIKSHA 'O' ANUSANDHAN University, focusing on trees and distance. It includes various questions related to graph theory concepts such as diameter, radius, spanning trees, and properties of trees, along with methods like Edge Contraction and Matrix Tree Computation. The assignment carries a weightage of 10 marks and aims to assess students' understanding and application of graph theory principles.

Uploaded by

sahoosubham750
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/ 2

ITER, SIKSHA ‘O’ ANUSANDHAN (Deemed to be University) Assignment

Branch CSE & CSIT Programme B.Tech.


Course Name INTRODUCTORY GRAPH THEORY Semester 2ND
Course Code CSE 1004 Academic Year 2024-25
Assignment - 2 Topic: Trees and Distance
Learning Level L1: Remembering L3: Applying L5: Evaluating
(LL) L2: Understanding L4: Analysing L6: Creating
Q’s Questions COs LL
Find the diameter and the radius of the each of the following graphs:

Q1 CO2 L3

Use the Edge Contraction method to find the total number of spanning
trees in each of the graphs given below:

Q2 CO2 L3

Use the Matrix Tree Computation method to find the total number of
spanning trees in each of the following graphs:

Q3 CO2 L3

Let T be an m-ary tree of order n having i internal vertices and l leaves.


Prove that
(a) n = m . i + 1 = (m . l - 1) / (m - 1)
Q4 CO2 L3
(b) i = (n - 1) / m = (l - 1) / (m - 1)
(c) l = ( (m - 1) n + 1 ) / m = (m - 1) i + 1

Let G be a graph. Prove that G is a tree if and only if G is connected and


Q5 CO2 L3
every edge in G is a cut-edge.
Let G be a graph. Prove that G is a tree if and only if adding any edge with
Q6 CO2 L3
endpoints in V(G) creates exactly one cycle.
Q7 Prove that if G is a tree of order n, then the size of G equals n − 1. CO2 L3
Q8 A forest T of order n has k components. Find the size of T. CO2 L3
Use Kruskal’s Algorithm to find a minimum weight spanning tree for each
of the following graphs and also calculate the weights of these trees in each
case:

CO2
Q9 L3

There are five cities in a network. The travel time for traveling directly from i
to j is the entry 𝑎 in the matrix below. The matrix is not symmetric (use
directed graphs), and 𝑎 = ∞ indicates that there is no direct route.
Determine the least travel time and quickest route from i to j for each pair
i,j.
CO2
Q10 L3

Note:

1. Assignment carries a weightage of 10 marks out of 100


2. The course outcome CO2 is covered.
Able to understand the fundamental concepts of graphs and apply them to study graph
CO1 isomorphisms, Eulerian graphs, graphic sequences and digraphs.
Able to understand the concepts of trees, spanning trees and study its various concepts and
CO2 apply the Kruskal’s algorithm to find the minimum spanning tree and Dijkstra’s algorithm to find
the shortest path of connected weighted graphs.
Course CO3 Able to understand matchings and factorization of graphs and its various applications.
Outcomes Able to understand and analyze coloring of graphs, it’s enumerative aspects and its
CO4 applications.
CO5 Able to understand and analyze planar graphs and its various applications.
Able to understand the concepts of line graphs, edge-coloring and the various aspects
CO6 Hamiltonian cycles.

You might also like