ECT202 Analog Circuits
ECT202 Analog Circuits
Module 2
Eulerian and Hamiltonian graphs : Euler graphs, Operations on graphs, Hamiltonian paths
and circuits, Travelling salesman problem. Directed graphs – types of digraphs, Digraphs
and
binary relation, Directed paths, Fleury’s algorithm.
Module 3
Trees and Graph Algorithms : Trees – properties, pendant vertex, Distance and centres
in a
tree - Rooted and binary trees, counting trees, spanning trees, Prim’s algorithm and
Kruskal’s
algorithm, Dijkstra’s shortest path algorithm, Floyd-Warshall shortest path algorithm.
Module 4
Connectivity and Planar Graphs : Vertex Connectivity, Edge Connectivity, Cut set and Cut
Vertices, Fundamental circuits, Planar graphs, Kuratowski’s theorem (proof not required),
Different representations of planar graphs, Euler's theorem, Geometric dual.
Module 5
number, Chromatic polynomial, Matchings, Coverings, Four color problem and Five color
problem. Greedy colouring algorithm.
Text book:
KTU BTECH S3 SYLLABUS