Chapter 10.1 Graphs and Graph Models Flashcards

1
Q

Defination Of A Graph

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

Define Infinite & Finite Graph

A

A graph with an infinite vertex set or an infinite number of edges is called an infinite graph, and in comparison, a graph with a finite vertex set and a finite edge set is called a finite graph.

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

Define Simple Graph

A

simple graph: an undirected graph with no multiple edges or loops

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

Define Multigraphs

A

multigraph: an undirected graph that may contain multiple edges but no loops

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

Define Loops

A

loop: an edge connecting a vertex with itself

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

Define Pseudographs

A

pseudograph: an undirected graph that may contain multiple edges and loops

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

Define A Directed Graph

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

Define Simple Directed Graph

A

a directed graph without loops or multiple directed edges

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

Define Directed multigraphs

A

a graph with directed edges that may contain multiple directed edges

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

Define multiplicity

A

When there are m directed edges, each associated to an ordered pair of vertices (u, v), we say that (u, v) is an edge of multiplicity m.

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

Graph Terminology Table

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