Graph Theory Flashcards

1
Q

is a branch of mathematics and computer science that deals with the study of graphs

A

Graph theory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

SIGNIFICANCE OF GRAPH THEORY

A

Mathematical Abstraction
Networks
Transportation and Routing
Social Sciences
Computer Science
Circuit Design

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

is a mathematical structure that consists of a set of nodes (or vertices) and a set of edges that connect pairs of nodes.

A

Graph

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

These are the fundamental elements of a graph, it represent individual entities, points, or objects.

A

Nodes (Vertices))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

These are connections between pairs of nodes. They represent relationships, interactions, or links between the corresponding entities.

A

Edges

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

The number of vertices of a graph.

A

Order

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

If there is more than one edge that connects two different vertices.

A

Parallel Edges

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

An edge that connects a vertex to itself.

A

Loop

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

A graph does not contain parallel edges or loops.

A

Simple graph

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

a sequence of vertices and edges of a graph i.e. if we traverse a graph . Edge and Vertices both can be repeated.

A

Walk

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

if the starting and ending vertices are different i.e. the origin vertex and terminal vertex are different.

A

Open walk

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

if the starting and ending vertices are identical i.e. if a walk starts and ends at the same vertex.

A

Closed walk

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

is an open walk in which no edge is repeated. Vertex can be repeated.

A

Trail

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

If there is a path between any pair of nodes. In other words, no nodes are isolated.

A

Connected Graph

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

It is a trail in which neither vertices nor edges are repeated i.e. if we traverse a graph such that we do not repeat a vertex and nor we repeat an edge. It is also an open walk

A

Path

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Traversing a graph such that we do not repeat a vertex nor we repeat a edge but the starting and ending vertex must be same i.e. we can repeat starting and ending vertex.

A

Cycle

17
Q

If at least two vertices of the graph are not connected by a path.

A

Disconnected Graph

18
Q

edges have a direction, indicating that a relationship between nodes is one-way.

A

Directed Graph

19
Q

edges have no direction, meaning the relationship between nodes is mutual.

A

Undirected Graph