Graph Theory Flashcards

1
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
2
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
3
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
4
Q

These are the fundamental elements of a graph.
They 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

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

The graph that has no edges is sometimes called

A

Null graph

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
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
9
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
10
Q

A graph that 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
11
Q

Is a sequence of vertices and edges of 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
12
Q

The starting and ending vertices in this walk are different

A

Open walk

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

The starting and ending vertices in this walk are identical

A

Close walk

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

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
15
Q

A graph is considered this 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
16
Q

It is a trail in which neither vertices nor edges are repeated

A

Path

17
Q

A graph where we do not repeat a vertex nor we repeat a edge but the starting and ending vertex must be the same

A

Cycle

18
Q

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

A

Disconnected Graph

19
Q

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

A

Directed Graph (digraph)

20
Q

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

A

Undirected Graph