Scribd
Upload
62 views14 pages

Graph Theory: 1) A Directed Graph (Digraph) 2) Un Direction Graph

The document discusses various topics in graph theory including directed and undirected graphs, loops, multigraphs, simple graphs, in degrees and out degrees, regular graphs, complete graphs, cycle graphs, wheel graphs, bipartite graphs, complete bipartite graphs, path graphs, circuits, isomorphic graphs, homeomorphic graphs, bridges, Euler's paths, Hamiltonian cycles, colorings, matchings, covers, cuts, connectivity, Dirac's theorem, and induced subgraphs.

Uploaded by

Abhisekh Jain
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
62 views14 pages

Graph Theory: 1) A Directed Graph (Digraph) 2) Un Direction Graph

The document discusses various topics in graph theory including directed and undirected graphs, loops, multigraphs, simple graphs, in degrees and out degrees, regular graphs, complete graphs, cycle graphs, wheel graphs, bipartite graphs, complete bipartite graphs, path graphs, circuits, isomorphic graphs, homeomorphic graphs, bridges, Euler's paths, Hamiltonian cycles, colorings, matchings, covers, cuts, connectivity, Dirac's theorem, and induced subgraphs.

Uploaded by

Abhisekh Jain
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Graph Theory

1) A Directed Graph (DiGraph) 2) UN Direction Graph

3) Loop 5) Multi Graph

4) Simple Graph

6) In degree out degree

B has in-degree 3 and out-degree 1 7) Regular Graph:

8) Complete Graph:

9) Cycle Graph: (It can be UN directional as well)

10) Wheel Graph:

11) Bipartite Graph:

12) Complete Bipartite Graph:

13) Path Graph:

14) Circuit:

15) Isomorphic Graph:

16) Homeomorphic Graphs:

17) Bridge:

18) Eulers Path:

19) Hamiltonian Cycle:

20) http://www.personal.kent.edu/~rmuhamma/GraphTheory/MyGraphTheory/planarity.htm

21) Coloring Scheme in graph theory:

22) Matching: Given a graph G = (V,E), a matching M in G is a set of pairwise non-adjacent edges; that is, no two edges share a common vertex. A vertex is matched (or saturated) if it is an endpoint of one of the edges in the matching. Otherwise the vertex is unmatched. A maximal matching is a matching M of a graph G with the property that if any edge not in M is added to M, it is no longer a matching, that is, M is maximal if it is not a proper subset of any other matching in graph G. In other words, a matching M of a graph G is maximal if every edge in G has a non-empty intersection with at least one edge in M. The following figure shows examples of maximal matchings (red) in three graphs.

A perfect matching (a.k.a. 1-factor) is a matching which matches all vertices of the graph. That is,

every vertex of the graph is incident to exactly one edge of the matching. Figure (b) above is an example of a perfect matching. Every perfect matching is maximum and hence maximal. In some literature, the term complete matching is used. In the above figure, only part (b) shows a perfect matching. A perfect matching is also a minimum-size edge cover. Thus,(G) (G) , that is, the size of a maximum matching is no larger than the size of a minimum edge cover. A near-perfect matching is one in which exactly one vertex is unmatched. This can only occur when the graph has an odd number of vertices, and such a matching must be maximum. In the above figure, part (c) shows a near-perfect matching. If, for every vertex in a graph, there is a near-perfect matching that omits only that vertex, the graph is also called factor-critical. 23) Covering

Formally, a vertex cover of a graph G is a set C of vertices such that each edge of G is incident to at least one vertex in C. The set C is said to cover the edges of G. The following figure shows examples of vertex covers in two graphs (the set C is marked with red).

A minimum vertex cover is a vertex cover of smallest possible size. The vertex cover number is the size of a minimum vertex cover. The following figure shows examples of minimum vertex covers in two graphs.

24 ) Complementary graph:

25) A cut set of a connected graph G is a set S of edges with the following properties The removal of all edges in S disconnects G. The removal of some (but not all) of edges in S does not disconnects G. As an example consider the following graph

We can disconnect G by removing the three edges bd, be, and ce, but we cannot disconnect it by removing just two of these edges. Note that a cut set is a set of edges in which no edge is redundant. 26) Edge Connectivity: The edge-connectivity (G) of a connected graph G is the smallest number of edges whose removal disconnects G. When (G) k, the graph G is said to be k-edge-connected. Vertex Connectivity: The connectivity (or vertex connectivity) K(G) of a connected graph G (other than a complete graph) is the minimum number of vertices whose removal disconnects G. When K(G) k, the graph is said to be k-connected (or k-vertex connected). When we remove a vertex, we must also remove the edges incident to it. As an example consider following graphs. 27) Dirac's Theorem : Let G be a simple graph with n vertices where n 3 If deg(v) 1/2 n for each vertex v, then G is Hamiltonian.

n = 6 and deg(v) = 3 for each vertex, so this graph is Hamiltonian by Dirac's theorem. 28) Induced subgraphs If H is a subgraph of G and u and w are vertices of H, then by the definition of a subgraph, u and w are also vertices of G. However, if u and w are adjacent in G (i.e., there is an edge of G joining them), the definition of subgraph does not require that the edge joining them in G is also an edge of H. If the subgraph H has the property that whenever two of its vertices are joined by an edge in G, this edge is also in H, then we say that H is an induced subgraph. Here is an example of two subgraphs of G, defined on the same set of vertices where one is an induced subgraph and the other isn't.

29)

You might also like