Please enable JavaScript.
Coggle requires JavaScript to display documents.
Graph Theory - Coggle Diagram
Graph Theory
Graph
Algorithms
Detecting Negative Cycles
Detecting Strongly Connected Components
Graph
Coloring
Vertex Coloring
Chromatic Number
Edge Coloring
Edge Chromatic Number
Total Coloring
Shortest Path
A*
Belmon Ford
Dijkstra Algorithm
Lazy
Eager
Graph
Traversing
BFS
DFS
In Order
Post Order
Pre Order
Connectivity
Traveling Salesman Problem
Network Flow
Ford-Fulkerson
Edmonds-Karp
Dinics
Minimum Spanning Tree
Kruskals
Prims
Topological Sort
Fundamentals
Graph
Representations
Adjacency Matrix
Edge List
Adjacency List
Incidence Matrix
Types of
Graphs
Multi
Pseudo
Regular
Platonic
Simple
Null
Trivial
Bipartite
Complete Bipartite Graph
Trees
Planar
Cycles
Paths
Wheels
Construction of
New Graphs using
Old Graphs
Subgraphs
Walk
Trial
Circuit
Path
Cycle
Eulerian
Hamiltonion
Terminology
Basic 4
Types of graphs
Unweighted Directed
Weighted Undirected
Unweighted Undirected
Weighted Directed
Degree
Degree Sequence
Handshaking Theorem
Maximum Degree - Δ(G) and Minimum Degree - ẟ (G)
Even and Odd Vertices
Total degree (G)
Size(G) |E|
Order(G) |V|
Relationship
between E and V
Incidence - Edge is incidence to its endpoints
Adjacent
Edge Adjacency - if they are share same vertex
Vertex Adjacency - if they are connected by an edge
G
V(G)
V(E)
Isomorphism
Connectedness
Disconnecting Set
Separating Set
Eccentricity
Diameter
Radius
Distance
Graph Operations
Binary Operations
Union
Intersection
Sum
Ring Sum
Cartesian Product
Unary Operations
Edge/ Vertex Addition
Edge/ Vertex Deletion
Graph Transpose
Graph Complement