Quiz - Graph theory

1. A graph that has neither self loop nor parallel edges is called ....

• simple graph

• multi graph

• pseudo graph

• none

2. Number of edges ending at a vertex is called ...

• outdegree

• indegree

• degree

• none

3. A vertex has degree 1 is called ....

• isolated

• pendant

• trivial

• none

4. A graph is called an eulerian graph if it contains a closed ......

• walk

• eulerian trail

• eulerian path

• none

4. A graph is said to be a hamiltonian graph if it contains ...

• hamiltonian path

• hamiltonian walk

• hamiltonian cycle

• none

6. Two edges are said to be .... edges if they are non - adjacent

• dependent

• independent

• both

• none

7. Let T be a spanning tree , then the edges of T is called ....

• vector space

• chord

• branches

• none

8. The edges of E ( G ) - E ( T ) is called ...

• branches

• chord

• vector

• none

9. The subspace closely related with the cyclic subspace is called ....

• cycle space

• vector space

• cut set space

• none

10. An embedding of a planar graph is called ...

• planar

• plane

• regions

• none