MA8351 DM Graphs

Every Isomorphic graph must have ________ representation.

• cyclic
• adjacency list
• tree
• adjacency matrix

An isomorphism of graphs G and H is a bijection f the vertex sets of G and H. Such that any two vertices u and v of G are adjacent in G if and only if ____________

• f(u) and f(v) are contained in G but not contained in H
• f(u) and f(v) are adjacent in H
• f(u * v) = f(u) + f(v)
• f(u) = f(u)2 + f(v)2

A ______ in a graph G is a circuit which consists of every vertex (except first/last vertex) of G exactly once.

• Euler path
• Hamiltonian path
• Planar graph
• Path complement graph

A trail in a graph can be described as ______________

• a walk without repeated edges
• a cycle with repeated edges
• a walk with repeated edges
• a line graph with one or more vertices

What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6?

• 11
• 14
• 18
• 19

If there is an Edge from v1 to v1 that edge is called

• Parallel edge

• self loop

• Incident

• Isolated

If the degree of any vertex is one, then that vertex is called

• Isolated vertex

• Adjacent vertex

• Pendent vertex

• Not Adjacent vertex

What is degree of the vertex?

• The number of edges incident at the vertex

• The number of vertices incident at the vertex

• The number of edges not incident at the vertex

• None of the above

In an undirected graph, The numbers of odd degree vertices are

• Odd

• Odd and Even

• Even

• None of the above

What is regular graph ?

• Vertices have different degree

• Many vertices have same degree

• Every vertex of a simple graph has the different degree

• Every vertex of a simple graph has the same degree