2019 B.Tech. Information Technology B.E Jadavpur University Information Technology  Graph Theory (3rd Year First Semester) 2019 Question paper
Are you looking for the old question papers of Jadavpur University Information Technology  Graph Theory? Here is the previous year question paper from Jadavpur University. This is the original question paper from the IT Department for Third year first semester exam conducted by Jadavpur University in year 2019. Feel free to download the question paper from here and use it to prepare for your upcoming exams.
{Scroll Below to get the PDF Attachment file of the Original Question Paper}
Exam Name B.Tech Information Technology Engineering Exam 3rd Year 1st Semester
Subject Graph Theory
Total Time Three Hours Maximum Marks 100
Syllabus
Introduction: Different examples, (dis)connected graph, subgraph, isomorphism, labeled graph, Euler graph, Hamiltonian graph. Trees: definitions, center, radius, diameter, rooted tree; spanning tree, spanning forest, rank & nullity of a graph, fundamental circuit, tree graph, number of spanning tree in complete graph: Prufer sequence. Operations on graph: deletion of vertex/edge, fusion, union, intersection, ring sum, decomposition of a graph. Connectivity/ cutest: definition of cutset, edge connectivity, vertex connectivity, cut vertex, relation with edge connectivity and vertex connectivity, kconnected graph, separable graph, 1isomorphism, 2connected graph, 2isomorphism. Planar graph: definition with examples, nonplanar graph, Euler theorem, planarity detection, geometric dual graph, uniqueness of dual, dual of a subgraph, combinatorial dual, self dual, maximal planar graph. Graph Coloring: definition, chromatic number, chromatic partition, independent set, dominating set, chromatic polynomial. Graph Matching: definition, complete matching. Covering: minimal covering, perfect matching, vertex cover. Graph representation: incidence matrix, adjacency matrix, – Submatrices – Circuit Matrix – Path Matrix Directed Graphs: Types of Directed Graphs, Digraphs and Binary Relations, Directed Paths and Connectedness, Adjacency Matrix of a Digraph. Basic counting rules: sum rule, subtraction principle, product rule, division principle, permutations, rpermutation, combinatorics, sampling problem {with replacement}
Attachments:
Return to question paper search
