GT Chapter 1 & 2

Match the points:

1. Edge having the same vertex as both its end vertices

2. Edge having the same two end vertices

• 1. Parallel Edge

  2. Self Loop

• 1. Self Loop

  2. Parallel Edge

Valency (Degree) of vertex V3 is

• 2

• 3

• 4

• 1. V2 is an Isolated Vertex

  2. V3 is a Pendant Vertex

• 1. V3 is an Isolated Vertex

  2. V2 is a Pendant Vertex

A graph where all the vertices have the same degree

• Simple Graph

• General Graph

• Finite Graph

• Regular Graph

A graph where neither self loop nor parallel edge are allowed

• Simple Graph

• General Graph

• Finite Graph

• Regular Graph

Answer explanation

A graph where both of them are allowed is called a General Graph

G = (V,E)

V = {V1, V2, V3, ....}

E = {E1, E2, E3, ....}

Graph G is a type of

• Finite Graph

• Infinite Graph

Null Graph is a graph G = (V, E) where

• V ≠ {Φ}

  E = {Φ}

• E ≠ {Φ}

  V = {Φ}

Answer explanation

Every vertex in a Null graph is an Isolated vertex

e is the total number of edges

v is the total number of vertices

• e

• v

• 2*e

• 2*v

Answer explanation

Since each edge contributes two degrees : one 'entry' & one 'exit'

Are (a) and (b) isomorphic?

• Yes

• No

Answer explanation

Isomorphic graphs are the same graph, only drawn differently

Every graph is its own proper subgraph

• True

• False