Scribd
Upload
4 views1 page

Module 4 - Assignment 1-1

The document presents a series of multiple-choice questions related to graph theory, covering concepts such as graph definitions, loops, parallel edges, and graph components. It includes questions about labelled vs unlabelled graphs, simple graphs, and the effects of adding or removing edges on graph components. The content is structured as an assignment for a module, likely aimed at assessing understanding of fundamental graph concepts.

Uploaded by

josephswarooppunnackal
Copyright
© All Rights Reserved
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
4 views1 page

Module 4 - Assignment 1-1

The document presents a series of multiple-choice questions related to graph theory, covering concepts such as graph definitions, loops, parallel edges, and graph components. It includes questions about labelled vs unlabelled graphs, simple graphs, and the effects of adding or removing edges on graph components. The content is structured as an assignment for a module, likely aimed at assessing understanding of fundamental graph concepts.

Uploaded by

josephswarooppunnackal
Copyright
© All Rights Reserved
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

Module 4 - Assignment 1 10.

Two graphs with the same structure but different ver-


tex names are called
1. A graph G is defined as
(A) Labelled graphs
(A) A set of vertices only (B) Unlabelled graphs
(B) A set of edges only (C) Directed graphs
(C) A pair consisting of a vertex set and an edge set (D) Weighted graphs
(D) A collection of numbers 11. A graph having exactly two components must be
2. A loop in a graph is an edge (A) Complete
(A) Joining two distinct vertices (B) Connected
(B) Having no end vertices (C) Disconnected
(D) Simple
(C) Joining a vertex to itself
(D) Joining three vertices 12. Which of the following can increase the number of
components in a graph?
3. Parallel edges are
(A) Adding an edge between two vertices of the same
(A) Edges with the same weight component
(B) Edges joining the same pair of vertices (B) Removing an edge
(C) Edges forming a cycle (C) Adding a loop
(D) Adding a parallel edge
(D) Edges with different directions
13. The disjoint union of two graphs always results in a
4. A simple graph is a graph that has
graph that is
(A) Only one vertex (A) Connected
(B) No edges (B) Simple
(C) No loops and no parallel edges (C) Disconnected
(D) Only parallel edges (D) Complete
5. In a labelled graph, 14. If a graph has 3 components, then it is

(A) Only edges are labelled (A) Connected


(B) Only vertices are labelled (B) Simple
(C) Disconnected
(C) Vertices (and possibly edges) are assigned labels
(D) Complete
(D) No labels are used
15. Which of the following graphs is not connected?
6. A graph with 5 vertices and no edges is
(A) A graph with one vertex
(A) A complete graph (B) A graph with vertices but no edges
(B) A connected graph (C) A tree
(C) A non-simple graph (D) A cycle graph
(D) A disconnected graph 16. A graph with loops and parallel edges is best de-
7. Which of the following graphs must be simple? scribed as
(A) Simple graph
(A) Graph with loops
(B) Multigraph
(B) Graph with parallel edges
(C) Connected graph
(C) Graph with neither loops nor parallel edges
(D) Complete graph
(D) Graph with exactly one edge
17. If two graphs are disjoint, then they
8. If a graph has a loop, then it is
(A) Share some vertices
(A) A simple graph (B) Share some edges
(B) A complete graph (C) Have no common vertices
(C) Not a simple graph (D) Must be connected
(D) A disconnected graph 18. Which statement is true?
9. The union of two graphs G1 and G2 has (A) Every simple graph is connected
(B) Every connected graph is simple
(A) Only the vertices common to both
(C) A graph with one component is connected
(B) Only the edges common to both
(D) A disconnected graph has no edges
(C) Vertices and edges from both graphs
***********************************************
(D) No common elements

You might also like