UNIT-3: Graphs

3.1 Introduction

3.2 Basic terminology

3.2.1 What is graph?
3.2.1.1 Order and size of a graph
3.2.1.2. Adjacent Vertices
3.2.1.3. Parallel edges
3.2.1.4. Loop or Self loop
3.2.1.5. Adjacent edges

3.2.2 Kinds of Graph:

3.2.2.1 Simple graph
3.2.2.2 Multi graph or Multiple graph
3.2.2.3 Pseudo Graph

3.2.3. Weighted Graph

3.2.4 Finite and Infinite graphs

3.2.5 Degree of a vertex

3.2.5.1. Isolated Vertex
3.2.5.2. Pendant Vertex
3.2.5.3. Handshaking Lemma

PROBLEMS

3.2.6 Null Graph

3.2.7 Complete Graph

3.2.8 Regular Graph

3.2.9 Directed graph or Diagraph

3.2.9.1. Parallel Edges or Multiple arcs or multiple edges in a directed graph
3.2.9.2. Self loop in a directed graph
3.2.9.3. Indegree and Outdegree of vertex V in a directed graph
3.2.9.4. Source Vertex
3.2.9.5. Sink Vertex

PROBLEMS

3.2.9.6. Simple directed graph

3.2.9.7. Directed multiple graph
3.2.9.8 Directed pseudo graph
3.2.9.9 Underlying graph of diagraph
3.2.9.10 Pendent vertex in diagraph

1
3.3 Connected and Disconnected Graph

3.3.1 Strongly connected and weakly connected graph

3.4 Components of a graph

3.5. Paths and circuits

3.5.1 Path
3.5.1.1 Simple Path
3.5.1.2 Elementary Path
3.5.1.3 Length of the path

3.5.2 Cycle or circle or circuit

3.5.2.1 Simple circuit
3.5.2.2 Elementary circuit
3.5.2.3 Length of circuit

PROBLEMS:

3.6 Shortest path Algorithm

PROBLEMS

3.7 Eulerian Path and Eulerian circuit

3.7.1 Eulerian path

3.7.2 Eulerian Circuit
3.7.3 Eulerian Graph
3.7.4 Semi- Eulerian Graph
3.7.5. Theorems:

3.8 Hamiltonian path and Hamiltonian circuit

3.8.1 Hamiltonian Path

3.8.2 Hamiltonian Circuit
3.8.3 Hamiltonian Graph
3.8.4 Semi-Hemiltonian graph

PROBLEMS:

3.9 Subgraph
3.9.1 Properties of Subgraph
3.9.2 Edge Disjoint Subgraph
3.9.3 Vertex disjoint Subgraph

PROBLEM

2
3.10 Spanning Subgraph

3.11 Factors of a graph

PROBLEMS

3.12 Equivalent graph’s or Isomorphic graph

PROBLEMS

3.13 Complement of a graph

3.13.1 Self complementary graph

3.13.2 Complement of a subgraph G| with respect to the graph G

PROBLEMS

3.14 Planar Graph

3.14.1 Region of a graph

PROBLEMS

3.14.2 Properties of planar graphs

3.14.3 Euler’s Formula:

PROBLEMS

3.15 Connectivity

3.15.1 Introduction
3.15.2 Edge connectivity
3.15.3 Vertex connectivity

3.16 Matching:

3.16.1: Definition
3.16.2: Matching Terminology
3.16.2.1 Maximal Matching
3.16.2.2 Maximum Matching
3.16.2.3 Perfect Matching

3.16.3 Application of graph matching

3.17 Graph coloring and chromatic number

3.17.1: Applications of Graph Coloring

3
3.18 Representation of Graph

3.18.1 Incidence matrix

3.18.1.1 Incidence matrix representation for undirected graph

3.18.1.2 Incidence matrix representation for directed graph
3.18.1.3 Advantage and disadvantage of Incidence matrix

3.18.2 Adjacency matrix:

3.18.2.1 Adjacency matrix representation for undirected graph

3.18.2.2 Adjacency matrix representation for directed graph
3.18.2.3 Advantage and disadvantage of Adjacency matrix

PROBLEMS