Introduction to Network Analysis in Graph Theory
A beginner's quiz on the fundamentals of network analysis using graph theory.
Questions in this quiz
15 questions on Introduction to Network Analysis in Graph Theory. Work through them here, then start the quiz to answer them and see your score.
1.What is a graph in the context of graph theory?
- AA collection of nodes and edges
- BA sequence of numbers
- CA type of chart used in statistics
- DA mathematical function
2.Which of the following is a common use of network analysis?
- AAnalyzing social networks
- BCompiling code
- CPredicting weather patterns
- DEncrypting data
3.What is the degree of a vertex in a graph?
- AThe number of edges connected to it
- BThe total weight of the graph
- CThe number of vertices in the graph
- DThe distance from the root
4.In a directed graph, what is an 'in-degree'?
- ANumber of outgoing edges from a vertex
- BTotal number of edges in the graph
- CNumber of incoming edges to a vertex
- DNumber of vertices in the graph
5.What is a path in graph theory?
- AA disconnected graph
- BA loop in a graph
- CA single edge in a graph
- DA sequence of edges connecting vertices
6.What is a cycle in a graph?
- AA path that starts and ends at the same vertex
- BA graph with no edges
- CA path with no repeating vertices
- DA sequence of disconnected vertices
7.What is a connected graph?
- AA graph with only one vertex
- BA graph where there is a path between every pair of vertices
- CA graph with no cycles
- DA graph with isolated vertices
8.What is a tree in graph theory?
- AA graph with cycles
- BA graph with only one vertex
- CA connected acyclic graph
- DA graph with multiple disconnected components
9.What is the shortest path problem?
- AFinding a path that visits every vertex
- BFinding the minimum path between two vertices
- CFinding a cycle in a graph
- DFinding the longest path in a graph
10.What is Dijkstra's algorithm used for?
- AFinding a cycle in a graph
- BFinding the shortest path in a weighted graph
- CSorting vertices
- DCounting the number of edges
11.What is a bipartite graph?
- AA graph with multiple components
- BA graph with a single cycle
- CA graph with no edges
- DA graph whose vertices can be divided into two disjoint sets
12.What is the adjacency matrix of a graph?
- AA sequence of edges
- BA matrix of vertex degrees
- CA list of vertices
- DA matrix representing the connections between vertices
13.What is a weighted graph?
- AA graph with only one vertex
- BA graph where edges have weights
- CA graph with no weights
- DA graph with multiple cycles
14.What is a spanning tree?
- AA graph with no edges
- BA graph with isolated vertices
- CA graph with cycles
- DA subgraph that includes all vertices and is a tree
15.What is the purpose of network flow analysis?
- ATo find the shortest path
- BTo count vertices
- CTo determine the maximum flow in a network
- DTo detect cycles