Combinatorial Problems in Graph Theory
N.B. Singh
This audiobook is narrated by a digital voice.
"Combinatorial Problems in Graph Theory" offers a comprehensive introduction to the fundamentals of graph theory for beginners. Exploring the fascinating world of graphs, this book covers essential concepts, from basic definitions to advanced applications across diverse fields such as computer science, optimization, and social networks. With clear explanations, practical examples, and engaging problems, it equips readers with the foundational knowledge needed to understand and solve combinatorial problems using graph theory. Ideal for students and enthusiasts alike, this book serves as an accessible entry point into this essential branch of mathematics.
Duration - 5h 17m.
Author - N.B. Singh.
Narrator - Digital Voice Mary G.
Published Date - Monday, 20 January 2025.
Copyright - © 2024 N.B. Singh ©.
Location:
United States
Description:
This audiobook is narrated by a digital voice. "Combinatorial Problems in Graph Theory" offers a comprehensive introduction to the fundamentals of graph theory for beginners. Exploring the fascinating world of graphs, this book covers essential concepts, from basic definitions to advanced applications across diverse fields such as computer science, optimization, and social networks. With clear explanations, practical examples, and engaging problems, it equips readers with the foundational knowledge needed to understand and solve combinatorial problems using graph theory. Ideal for students and enthusiasts alike, this book serves as an accessible entry point into this essential branch of mathematics. Duration - 5h 17m. Author - N.B. Singh. Narrator - Digital Voice Mary G. Published Date - Monday, 20 January 2025. Copyright - © 2024 N.B. Singh ©.
Language:
English
Preface
Duration:00:00:31
Introduction to Graph Theory
Duration:00:00:54
Basic Definitions and Concepts
Duration:00:03:13
Types of Graphs
Duration:00:03:54
Graph Representations
Duration:00:04:11
Graph Traversal Techniques
Duration:00:04:08
Fundamental Theorems in Graph Theory
Duration:00:03:46
Graph Coloring Problems
Duration:00:00:56
Vertex Coloring
Duration:00:02:00
Edge Coloring
Duration:00:03:45
Chromatic Number
Duration:00:03:57
Applications of Graph Coloring
Duration:00:04:40
Advanced Coloring Techniques
Duration:00:05:15
Graph Connectivity
Duration:00:00:54
Connected and Disconnected Graphs
Duration:00:04:36
Connectivity in Directed Graphs
Duration:00:04:31
Graph Cuts and Cutsets
Duration:00:04:08
Menger’s Theorem
Duration:00:04:38
Network Reliability
Duration:00:04:51
Graph Matching and Covering
Duration:00:01:00
Maximum Matching
Duration:00:04:53
Perfect Matching
Duration:00:04:49
Hall’s Marriage Theorem
Duration:00:04:31
Vertex Cover
Duration:00:05:07
Applications of Matching Theory
Duration:00:05:08
Hamiltonian and Eulerian Graphs
Duration:00:01:04
Eulerian Circuits and Paths
Duration:00:05:04
Hamiltonian Cycles and Paths
Duration:00:04:58
Dirac’s and Ore’s Theorems
Duration:00:05:00
Travelling Salesman Problem
Duration:00:04:49
Applications of Hamiltonian and Eulerian Graphs
Duration:00:04:13
Graph Algorithms and Complexity
Duration:00:01:06
Algorithmic Graph Theory
Duration:00:04:01
Shortest Path Algorithms
Duration:00:03:41
Minimum Spanning Tree
Duration:00:03:09
Graph Search Algorithms
Duration:00:03:21
Computational Complexity of Graph Problems
Duration:00:03:19
Extremal Graph Theory
Duration:00:01:06
Turán’s Theorem
Duration:00:03:07
Erdős-Stone Theorem
Duration:00:03:11
Ramsey Theory
Duration:00:02:58
Extremal Functions
Duration:00:03:00
Applications of Extremal Graph Theory
Duration:00:03:47
Random Graphs
Duration:00:01:01
Introduction to Random Graphs
Duration:00:03:31
Erdős–Rényi Model
Duration:00:04:03
Properties of Random Graphs
Duration:00:03:55
Phase Transitions in Random Graphs
Duration:00:03:56
Applications of Random Graphs
Duration:00:05:13
Planar Graphs and Graph Drawing
Duration:00:01:02
Planarity and Non-Planarity
Duration:00:04:51
Graph Drawing Algorithms
Duration:00:05:24
Applications of Planar Graphs
Duration:00:05:20
Graph Embedding
Duration:00:04:04
Spectral Graph Theory
Duration:00:01:00
Graph Spectra
Duration:00:02:59
Adjacency Matrix and Laplacian Matrix
Duration:00:04:58
Eigenvalues and Eigenvectors
Duration:00:04:30
Applications of Spectral Graph Theory
Duration:00:03:28
Cheeger’s Inequality
Duration:00:04:38
Graph Minors and Tree Decompositions
Duration:00:01:00
Graph Minors
Duration:00:04:33
Robertson-Seymour Theorem
Duration:00:03:14
Treewidth and Pathwidth
Duration:00:03:12
Tree Decomposition Algorithms
Duration:00:03:22
Applications of Graph Decompositions
Duration:00:03:38
Graph Isomorphism and Automorphisms
Duration:00:01:07
Graph Isomorphism Problem
Duration:00:03:25
Automorphism Groups
Duration:00:02:52
Isomorphism Testing Algorithms
Duration:00:03:07
Applications of Graph Isomorphism
Duration:00:03:26
Graph Symmetry
Duration:00:03:39
Network Flows
Duration:00:01:03
Max-Flow Min-Cut Theorem
Duration:00:02:55
Ford-Fulkerson Algorithm
Duration:00:03:29
Maximum Flow Problem
Duration:00:03:26
Applications of Network Flows
Duration:00:04:09
Flow Networks
Duration:00:03:16
Combinatorial Optimization in Graphs
Duration:00:01:15
Optimization Problems on Graphs
Duration:00:03:48
Traveling Salesman Problem
Duration:00:03:43
Knapsack Problem
Duration:00:03:34
Approximation Algorithms
Duration:00:04:03
Applications of Combinatorial Optimization
Duration:00:04:26
Applications of Graph Theory
Duration:00:01:17
Social Network Analysis
Duration:00:04:56
Biological Networks
Duration:00:05:16
Computer Networks
Duration:00:03:50
Operations Research
Duration:00:03:27
Graph Theory in Other Fields
Duration:00:03:49