Brainscape's Knowledge GenomeTM

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


See full index

Further Maths > Graphs > Flashcards

Graphs Flashcards

1
Q

What is a graph?

A

A graph is a set of lines connecting points

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

What is a network?

A

A network is a graph (set of lines connecting points) with weighted edges

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

What is the name for 2 graphs which are the same?

A

Isomorphic

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

What does isomorphic mean?

A

2 graphs are the same

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

What is a degree/order?

A

The degree/order is the number of edges connected to a vertex

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

What can vertices be?

A

Vertices can be even or odd

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

What is a walk?

A

A walk is a sequences of edges where the end vertex of one edge is the start vertex of the next

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

What is a trail?

A

A trail is a walk (sequences of edges where the end vertex of one edge is the start of the next) where none of the edges are repeated

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

What is a path?

A

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

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

What is a cycle/circuit?

A

A cycle/circuit is a closed path where the end of the path joins back to the beginning

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

What are other names for lines?

A

Edges/arcs

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

What are other names for points?

A

Vertices/nodes

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

What is a simple graph?

A

A simple graph has no loops and at most one edge connecting any pairs of vertices

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

When are 2 vertices connected?

A

2 vertices are connected if there is a path between them

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

What is a connected graph?

A

A connected graph is when all the pairs of vertices are connected

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

What is a tree?

A

A tree is a connected graph with no cycles

17
Q

What is a complete graph?

A

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

18
Q

What is a complete graph with n vertices referred to as?

A

Kn

19
Q

What does Kn represent?

A

A complete graph with n vertices

20
Q

What is Hamiltonian cycle?

A

A Hamiltonian cycle is a cycle which visits every vertex but no edges nor vertices are repeated

21
Q

What is a planar graph?

A

A planar graph is a graph that can be drawn so no edges cross

22
Q

What is Euler’s formula for planar graphs?

A

v-e+f=2

23
Q

What is a digraph?

A

A digraph has one or more edges that have an arrow that indicates you can go in one direction

Further Maths (2 decks)

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