Useful Links
Mathematics
Graph Theory
1. Introduction to Graph Theory
2. Fundamental Concepts and Types of Graphs
3. Representing Graphs
4. Paths, Walks, and Cycles
5. Graph Traversal
6. Trees and Forests
7. Shortest Path Algorithms
8. Network Flow
9. Graph Coloring
10. Planar Graphs
11. Matchings
12. Advanced Topics in Graph Theory
Fundamental Concepts and Types of Graphs
Basic Terminology
Adjacency
Adjacent Vertices
Adjacency in Undirected Graphs
Adjacency in Directed Graphs
Incidence
Incident Edges and Vertices
Incidence Relations
Degree of a Vertex
Degree in Undirected Graphs
In-degree in Directed Graphs
Out-degree in Directed Graphs
Degree Sequence
Handshaking Lemma
Statement and Proof
Consequences for Graph Structure
Types of Graphs
Undirected Graphs
Definition and Properties
Edge Representation
Directed Graphs (Digraphs)
Definition and Properties
Arc Representation
Underlying Undirected Graph
Simple Graphs
No Loops or Multiple Edges
Multigraphs
Multiple Edges Between Vertices
Pseudographs
Loops and Multiple Edges
General Graph Structure
Weighted Graphs
Edge Weights
Weight Functions
Unweighted Graphs
Binary Edge Relations
Structural Focus
Special Graph Structures
Complete Graphs
Definition and Notation (Kn)
Number of Edges
Bipartite Graphs
Definition and Properties
Vertex Partitions
Characterization by Odd Cycles
Testing for Bipartiteness
Complete Bipartite Graphs
Definition and Notation (Km,n)
Cycles
Definition and Notation (Cn)
Cycle Length
Paths
Definition and Notation (Pn)
Path Length
Wheels
Definition and Construction
Hub and Rim Structure
Regular Graphs
k-Regular Graphs
Petersen Graph
Construction
Significance in Graph Theory
Graph Isomorphism
Definition of Isomorphic Graphs
Formal Definition
Bijective Mapping
Structure Preservation
Examples and Non-examples
Invariants for Proving Non-Isomorphism
Degree Sequence
Number of Vertices and Edges
Number of Cycles
Connectivity Properties
Diameter
Girth
Other Structural Properties
Previous
1. Introduction to Graph Theory
Go to top
Next
3. Representing Graphs