Definitions Flashcards

0
Q

Subgraph

A

A subgraph is part of a graph

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

Graph

A

A graph consists of vertices (nodes) which are connected by edges (arcs)

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

Weighted graph

A

A graph where there is a number associated with each edge (arc)

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

Degree or valency

A

The number of edges (arcs) incident to a vertex (node)

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

Path

A

A finite sequence of edges where the end vertex (node) of an edge (arc) is the start vertex of the next edge and where no vertex appears more than once

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

Walk

A

A path where you can return to vertices (nodes) more than once

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

Trail

A

A walk with no repeated edges (arcs)

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

Cycle/ circuit

A

A closed path, the end vertex (node) of the last edge (arc) is the start vertex of the first node

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

Connected

A

Two vertices (nodes) are connected if there is a path between them

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

Connected graph

A

A graph where all of it’s vertices (nodes) are connected (have a path between them)

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

Loop

A

An edge (arc) that starts and finished at the same vertex (node)

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

Simple graph

A

A graph where there are no loops and does not have more than once edge (arc) connecting any pair of vertices (nodes)

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

Directed edge

A

An edge (arc) that has an associated direction

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

Digraph

A

A graph where edges (arcs) have a direction associated with them

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

Tree

A

A connected graph with no cycles

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

Spanning tree

A

A subgraph that contains all vertices and is a tree

16
Q

Bipartite graph

A

A graph consisting of two sets of vertices (nodes) where edges (arcs) can only connect to nodes in opposing sets

17
Q

Complete graph

A

A graph where every vertex (node) is directly connected by an edge (arc) to every vertex

18
Q

Complete bipartite graph

A

A bipartite graph where every vertex (node) is connected by an edge (arc) to every vertex in the opposing set of vertices

19
Q

Isomorphic graphs

A

Graph that show the same information but are drawn differently