Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Decision Maths > Networks Terminology > Flashcards

Networks Terminology Flashcards

1
Q

What is a walk?

A

A walk is a sequence of edges where the end vertex of an edge is the start vertex of the next

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

What is a trail?

A

A trail is a walk where none of the edges are repeated

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

What is a path?

A

A path is a trail where none of the vertices are repeated

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

What is a cycle?

A

A cycle is a closed path so the start of the path must end back at the start

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

What is a circuit?

A

Another name for a cycle

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

What is a verticie?

A

The points on a graph

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

What is a node?

A

Another name for a verticie

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

What is a network?

A

A network is a graph with weighted edges

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

What is an edge?

A

The lines that connect nodes are called edges

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

What is an arc?

A

Another name for an edge

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

What is the degree of a vertex?

A

The number of edges connected to it

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

What is another name for degree?

A

degree = order or valency

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

What are isomorphic graphs?

A

Two graphs that have the same edges and verticies are called isomorphic

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

What are weights?

A

Numbers on edges of the graph

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

What is a vertex of degree 1? 4? referred to as?

A

odd / even vertex

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

What is a simple graph?

A

A graph with no loops and at most one edge connecting any pair of verticies

17
Q

What is a planar graph?

A

A graph that can be drawn so that none of the edges cross

18
Q

What is a tree?

A

A tree is a connected graph that has no cycles

19
Q

What is a complete graph?

A

A complete graph is a graph where every pair of verticies is connected by a single edge

20
Q

What is a Hamiltonian Cycle?

A

A Hamiltonian Cycle is a cycle which visits all the vertexes of a graph

21
Q

What is a directed graph?

A

If the edges of a graph have a direction associated with them, they are known as directed edges and graph a directed graph.

(—>—)

Decision Maths (3 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions