Graph Theory
( Euler's Formula ) Let G be a connected plane graph with n vertices, q edges and f faces. Then n-q+f=2.
Theorem: ( Euler's Formula ) Let G be a connected plane graph with n vertices, q edges, and f faces. Th…
Theorem: ( Euler's Formula ) Let G be a connected plane graph with n vertices, q edges, and f faces. Th…
Distance in Graphs : Recall: The distance between two vertices u & v of a graph G, denoted by d(u,v), i…
Theorem: Any tree is a bipartite graph Proof: select a vertex as the root and color it white . Vertices in …
Matching and Job assignments Definition : A matching M in a graph is a set of edges , no two of which are in…
Theorem: A graph G is bipartite if and only if G does not contain an odd cycle . Proof: Suppose G is biparti…
1) Complete graphs: In the simple graph that has an edge between any pair of distinct vertices. If it has n…