GRAPH THEORY unit-I i

GRAPH THEORY unit-I i

University

8 Qs

quiz-placeholder

Similar activities

Quiz 1

Quiz 1

University

6 Qs

Quadratic Equations Given Vertex and a Point

Quadratic Equations Given Vertex and a Point

10th Grade - University

11 Qs

Quadratics Graphing

Quadratics Graphing

9th Grade - University

10 Qs

Quadratic Graphs Equations

Quadratic Graphs Equations

9th Grade - University

10 Qs

Parabola Increasing Decreasing

Parabola Increasing Decreasing

9th Grade - University

13 Qs

GRAPH AND TREES DAY 2

GRAPH AND TREES DAY 2

University

10 Qs

QUIZ 1

QUIZ 1

University

10 Qs

GRAPH THEORY unit-I i

GRAPH THEORY unit-I i

Assessment

Quiz

Mathematics

University

Medium

Created by

Pavithra M

Used 2+ times

FREE Resource

8 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the degree of a vertex in a graph?
The sum of edges
The number of nodes
The product of edges
The sum of weights

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many edges are incident on a vertex of degree 5 in a graph?
3
5
7
9

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If a graph has 5 vertices, what is the maximum number of edges it can have?
5
10
15
20

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a path in graph theory?
A way to reach a vertex from another vertex
A cycle in the graph
A sequence of edges in a graph
None of the above

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many paths can be between two vertices in a graph?
One path
Two paths
Depends on the graph
Infinite paths

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Can a graph have a cycle of length 0?
Yes
No
Sometimes
Depends on the graph

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Can a graph have a disconnected vertex?
Yes
No
Sometimes
Depends on the graph

8.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a connected component in graph theory?
A set of vertices where every vertex is reachable from every other vertex in set
A set of edges that form a cycle in a graph
A set of vertices and edges with no endpoints
None of the above