Notes in lecture1 - overview

To Subscribe, use this Key

Status	Last Update	Fields
Published	09/30/2023	simple graph
Published	09/30/2023	adjacent vertices
Published	09/30/2023	complete graph
Published	09/30/2023	a planar graph drawing
Published	09/30/2023	planar graph
Published	09/30/2023	isomorphism of graphs
Published	09/30/2023	bipartite graph
Published	09/30/2023	neighbors of \(v ∈ V\) in \(G\)
Published	09/30/2023	neighbors of \(W ⊂V\)
Published	09/30/2023	matching of a graph
Published	09/30/2023	necessary condition for the existence of a matching connecting all vertices in \(T ⊂V\)
Published	10/11/2023	path of length k
Published	09/30/2023	cycle of length k
Published	09/30/2023	what relations do simple graphs encode
Published	09/30/2023	directed graph
Published	09/30/2023	weighted graph
Published	09/30/2023	adjacency matrix
Published	09/30/2023	walk of length k
Published	09/30/2023	Method to find the number of walks of length \(l\) from  \(v_i \) to \( v_j\) in a graph
Published	09/30/2023	subgraph
Published	09/30/2023	induced subgraph
Published	09/30/2023	degree of a vertex
Published	09/30/2023	For any simple graph, \[{{c1::\sum_{v∈V} d(v)}} = {{c2::2\|E\|}}\]
Published	09/30/2023	Handshaking lemma
Published	09/30/2023	minimum degree of graph
Published	09/30/2023	Let G be a graph such that {{c1::\(δ(G) \geq 2\)}}. Then G contains* {{c2::a path of length at least \(δ(G)\)}}* {{c2::a cycle of length at least…
Status	Last Update	Fields