bluepython508/notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Initial work

Browse Source
This commit is contained in:
bluepython508
2023-11-01 08:55:40 +00:00
parent 996ea45153
commit 688d1ec426
48 changed files with 1148 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
CS1029/notes-2023-10-31 Normal file
View File

@@ -0,0 +1,13 @@
Simple Graph: unique connections, no reflexive connections
Multigraphs: multiple connections between two vertices permitted
Directed graphs/digraph
Pseudograph: permits self-links
Degree of vertex in an undirected graph: edges connected to vertex (loops contribute twice)
in a directed graph: in-degree is edges pointing to a vertex, out-degree is pointing out
Pendant vertex has degree 1
Sum of the degree of all vertices in an undirected graphs is twice the number of edges: handshake theorem
Bipartite: can be partitioned into two sets of vertices such that no edge connects two vertices in the same set
Complete bipartite: two vertices are connected \iff they are in seperate partitions
Matching in a bipartite graph: find a subgraph such that all vertices have *exactly* 1 edge attached