Quiz
Graphs
This quiz has question types that open in the usual player.
Questions in this quiz (14)
1Distinct edges that connect the same endpoints are called
- AComplete edges
- BMultiple edges
- CClosed edges
2What is the order of graph?
- AThe number of edges
- BThe number of nodes
- CNumber of paths
- DNumber of cycles
3The total number of edges containing the node u is called [blank_start]degree[blank_end] of a node u
- Adegree
4A graph where each vertex has he same number of neighbours (i.e. every node has the same degree) is called [blank_start]regular[blank_end] graph.
- Aregular
5A path is known as a [blank_start]closed[blank_end] path if the edge has the same end-points (i.e. v0 = vn)
- Aclosed
6In [blank_start]simple[blank_end] path all the nodes of the path are distinct with an exception that v0 may be equal to vn.
- Asimple
7A path in which the first and the last vertices are the same: [blank_start]cycle[blank_end]
- Acycle
8A graph in which there exists a path between any two nodes is called: [blank_start]connected[blank_end] graph
- Aconnected
9A graph G is called to be [blank_start]complete[blank_end] graph if all its nodes are fully connected.
- Acomplete
10A spanning tree of a weighted graph G, of minimum weight over all spanning trees of G is called: [blank_start]minimum spanning tree[blank_end]
- Aminimum spanning tree
11The shortest path is a path with
- AMinimum nodes involved
- BMinimum weight
12Number of edges that originate at node u is called: [blank_start]out-degree[blank_end] of a node
- Aout-degree
13The number of edges that terminate at node u is called: [blank_start]in-degree[blank_end] of a node
- Ain-degree
14The number of edges that terminate at node u is called: [blank_start]in-degree[blank_end] of a node
- Ain-degree
Information
- Description
- Quiz on Graphs, created by anisia molchanova on 06/04/2017.
- Author
- anisia molchanova
- Language
- English
- Views
- 0
- History
- Created on 6 Apr 2017 · updated on 6 Apr 2017
- Rating
- No ratings yet Rate this quiz