Graph Theory and Probability (CS32104) - Detailed Notes
Unit 1: Basics of Graph Theory
1.1 Graphs and Subgraphs
• A graph G = (V, E) is a collection of vertices V and edges E.
• A subgraph is a graph formed from a subset of vertices and edges of G.
• Example: G has V = {A, B, C} and E = {(A,B), (B,C)}. Subgraph H could be V = {A, B}, E = {(A,B)}.
1.2 Walks, Trails, Paths, Circuits
• Walk: Sequence of vertices where each adjacent pair is connected by an edge.
• Trail: A walk with no repeated edges.
• Path: A trail with no repeated vertices.
• Circuit: A closed trail (starts and ends at the same vertex).
1.3 Connected and Disconnected Graphs
• Connected: Every pair of vertices is connected by a path.
• Disconnected: Not all vertices are connected.
1.4 Components
• A component is a maximal connected subgraph.
1.5 Euler Graphs
• A graph is Eulerian if it contains a closed trail that includes every edge exactly once.
• Euler's Theorem: A connected graph is Eulerian iff all vertices have even degree.
1.6 Hamiltonian Paths and Circuits
• Hamiltonian Path: A path that visits each vertex exactly once.
• Hamiltonian Circuit: A Hamiltonian path that is a cycle.
1.7 Traveling Salesman Problem (TSP)
• Find the shortest possible route visiting each city once and returning to the start.
• TSP is NP-hard.
1.8 Directed Graphs (Digraphs)
• Edges have direction (ordered pairs).
• Directed Path: Follows direction of edges.
1
1.9 Euler and Hamiltonian Digraphs
• Eulerian digraph: In-degree = out-degree for all vertices.
• Hamiltonian digraph: Contains a Hamiltonian circuit respecting directions.
Unit 2: Trees and Fundamental Circuits
2.1 Trees and Properties
• A tree is a connected acyclic graph.
• Has n-1 edges for n vertices.
2.2 Distance, Diameter, Radius
• Distance: Shortest path between vertices.
• Diameter: Longest shortest path.
• Radius: Minimum of maximum distances from each vertex.
2.3 Pendent Vertices
• A vertex with degree 1.
2.4 Rooted and Binary Trees
• Rooted Tree: One vertex is the root; edges directed away.
• Binary Tree: Each node has at most two children.
2.5 Spanning Trees
• A spanning tree connects all vertices without cycles.
2.6 Algorithms
• Prim's Algorithm: Add minimum edge that connects a new vertex.
• Kruskal's Algorithm: Add edges in increasing weight, avoiding cycles.
• Dijkstra's Algorithm: Finds shortest paths from a source.
Unit 3: Cuts, Connectivity, and Planarity
3.1 Cut Sets and Cut Vertices
• Cut Vertex: Removal increases components.
• Cut Set: Edges whose removal increases components.
3.2 Connectivity and Separability
• Vertex Connectivity (k): Minimum vertices to disconnect.
2
• Edge Connectivity: Minimum edges to disconnect.
3.3 Network Flows
• Max-flow min-cut theorem relates maximum flow to minimum cut.
3.4 Planar Graphs
• Can be drawn without edge crossings.
• Euler’s Formula: V - E + F = 2 (for connected planar graphs).
3.5 Kuratowski’s Theorem
• A graph is non-planar iff it contains a subgraph homeomorphic to K5 or K3,3.
3.6 Dual Graphs
• Each face becomes a vertex; edges cross original edges.
3.7 Thickness and Crossing Number
• Thickness: Min number of planar graphs into which a graph can be decomposed.
• Crossing Number: Min edge crossings in any drawing.
Unit 4: Graph Matrices and Enumeration
4.1 Matrices
• Adjacency Matrix: A[i][j] = 1 if edge between i and j.
• Incidence Matrix: Rows = vertices, columns = edges.
• Circuit Matrix (B): Rows represent circuits.
4.2 Rank-Nullity Theorem
• Rank + Nullity = Number of columns.
4.3 Graph Coloring
• Assign colors so no two adjacent vertices share a color.
• Chromatic Number: Minimum number of colors.
4.4 Covering and Partitioning
• Vertex Cover: Subset of vertices covering all edges.
• Edge Cover: Subset of edges covering all vertices.
3
4.5 Enumeration
• Labeled Trees: Cayley's theorem: n^(n-2) trees with n labeled vertices.
• Unlabeled Trees: Count depends on isomorphism.
Unit 5: Probability and Combinatorics
5.1 Recurrence Relations
• Defined using earlier terms.
• Example: F(n) = F(n-1) + F(n-2)
5.2 Generating Functions
• Power series representing sequences.
• Help solve recurrence relations.
5.3 Permutations and Combinations
• Permutations: Arrangements (order matters).
• Combinations: Selections (order doesn't matter).
5.4 Probabilistic Counting
• Apply permutations/combinations in probability problems.
• Example: Probability of drawing 2 aces from a deck.
Let me know if you want diagrams or practice questions for any topic.
