Search Header Logo

Quiz - Graph theory

Authored by R. Maths

Mathematics

University

Used 1+ times

Quiz - Graph theory
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

1. A graph that has neither self loop nor parallel edges is called ....

simple graph

multi graph

pseudo graph

none

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

2. Number of edges ending at a vertex is called ...

outdegree

indegree

degree

none

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

3. A vertex has degree 1 is called ....

isolated

pendant

trivial

none

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

4. A graph is called an eulerian graph if it contains a closed ......

walk

eulerian trail

eulerian path

none

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

4. A graph is said to be a hamiltonian graph if it contains ...

hamiltonian path

hamiltonian walk

hamiltonian cycle

none

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

6. Two edges are said to be .... edges if they are non - adjacent

dependent

independent

both

none

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

7. Let T be a spanning tree , then the edges of T is called ....

vector space

chord

branches

none

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?