Notes in lecture3 - minimal spanning trees

To Subscribe, use this Key

Status	Last Update	Fields
Published	09/30/2023	minimal spanning forest T of a graph G
Published	09/30/2023	What does the Kruskal algorithm do
Published	09/30/2023	Kruskal algorithm
Published	09/30/2023	''Basisergänzungssatz (Steinitz exchange lemma)'' for forests
Published	10/11/2023	when is there a unique minimal spanning forest of a  graph (sufficient condition)
Published	09/30/2023	weighted length of a path
Published	10/02/2023	What is the dijkstra algorithm for
Published	10/11/2023	Dijkstra algortithmGiven {{c1::a weighted connected graph \(G=(V,E)\) with \(w:E → ℝ_0^+, v \in V\)}} construct the sequences* {{c2::\(V_0 ⊂…
Published	09/30/2023	Is non-negative weights a necessary condition in the Dijkstra algorithm
Published	09/30/2023	Laplacian matrix of a graph
Published	10/02/2023	Kirchoffs matrix-tree theorem
Published	10/11/2023	What can be said about the adjoint of the laplacian matrix
Published	10/11/2023	oriented vertex-edge incidence matrix
Published	09/30/2023	The connection between the Laplacian L(G) and vertex-edge incidence matrix N(G)
Published	09/30/2023	Cayleys formula for graphs
Status	Last Update	Fields