Have an account?
Skip to Content
Build your own quiz
Suggestions for you
12 questions
Show Answers
See Preview
- 1. Multiple Choice
In the Graph Theory, a graph need to have a minimum of _____ nodes and _____ edges.
1 ; 0
1 ; 1
2 ; 1
2 ; 2
- 2. Multiple Choice
Choose the FALSE statement from the statements below.
A node is also known as a vertex.
A link is also known as an edge.
A loop is counted as two edges.
The order of a graph is the total number of vertices of the graph.
- 3. Multiple Choice
Which of the following is a TRUE statement?
A graph can have many nodes but without edges.
A graph can have many edges but without nodes.
A graph can have no nodes and no edges.
A graph cannot be simple graph and complete graph at the same time.
- 4. Multiple Choice
A network consists of
minimum one node.
minimum two nodes.
minimum two nodes and one edge.
minimum three nodes and two edges.
- 5. Multiple Choice
A simple graph has no loops. What other property must a simple graph have?
It must be directed.
It must be undirected.
It must have at least one vertex.
It must have no multiple edges.
- 6. Multiple Choice
Determine a simple graph.
All the graphs are simple graphs.
- 7. Multiple Choice
Which graph is a simple graph but not complete graph?
- 8. Multiple Choice
By looking at the pattern of the numbers in the table, determine the number of edges for a complete graph to be drawn from 9 nodes given.
28
36
45
55
- 9. Multiple Choice
If the number of edges of a complete graph can be drawn from n nodes given is 91. What is the value of n?
12
13
14
15
- 10. Multiple Choice
You are required to construct a graph with 20 edges and each vertex with a degree of 4. How many vertices do you need to have on the graph?
8
10
12
15
- 11. Multiple Choice
Which of the following graph is FALSE?
- 12. Multiple Choice
Which one is NOT a subgraph of the above graph?
- Answer choicesTagsAnswer choicesTags