GRAPH THEORY

Question 1

Structures consisting of vertices and edges that connect the vertices.

Answer 1

GRAPH

Question 2

It is a graph with an edge joining identical vertices.

Answer 2

LOOP GRAPH

Question 3

A closed path of distinct edges of a graph is called

Answer 3

CIRCUIT

Question 4

A simple circuit in a graph containing every vertex of the graph

Answer 4

HAMILTONIAN

Question 5

TRUE OR FALSE: In any graph, the sum of all the vertex degrees is equal to twice the number of edges.

Sum of all the Vertex degrees = 2(Edges)

Answer 5

TRUE

Question 6

if there are a total of 5 edges, what is the sum of all the vertex degrees ?

Answer 6

10, because considering the formula
Sum of all the Vertex degrees = 2E with the 5 edges,

2(5) = 10

Question 7

How many edges are there if the sum of the degrees is 8?

Answer 7

The answer is 4.

2(E) = 8
2(E)/2 = 8/2
E = 4

Question 8

What are the elements of the graph theory?

Answer 8

VERTICES AND EDGES

Question 9

TRUE OR FALSE: A loop has one edge.

Answer 9

TRUE

Question 10

How many degree/s is/are there in a loop?

Answer 10

2

Question 11

In graph theory, the ORDER is the number of ______________

Answer 11

VERTICES

Question 12

The size is the number of

Answer 12

EDGES

Question 13

In Eulerian graph, if the total number of vertices is even it means that

Answer 13

THE BEGINNING IS ALSO THE ENDPOINT OF THE GRAPH

Question 14

Incident means

Answer 14

CONNECTED OR EDGES

Question 15

TRUE OR FALSE: In Eulerian Graph, there could be a maximum of 2 odd vertices.

Answer 15

TRUE