> See also: > - Reference # Graph Theory ![[Pasted image 20240429044514.png|400]] $G= (V,E)$ $E$ represents a seet of *edges* in $G$ - Ex: $E = \{(a,b),(e,c),...\}$ - $|E|$ represents the number of edges $V$ represents a set of *vertices (nodes)* in graph $G$ - Ex: $V=\{a,b,c,d,e\}$ - $|V|$ represents the number of vertices - The *degree* of a vertex represents the number of adjacent vertices **Similarity Matrix:** aa - Commonly used in data analysis for clustering, classification, and pattern recognition ## Graph Properties - [ ] Directed vs Undirected - [ ] Weighted vs Unweighted ![[Pasted image 20240430134227.png]] ## Representations of Graphs - [ ] **Adjacency Matrix:** aaa - [ ] Sparse Matrix --- - [ ] Adjacency List