math vocab Flashcards

1
Q

simple graph

A

undirected, inweighted graph with no loops or multiple edges

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

connected graph

A

if every vertex is connetced to every other vertex

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

complete graphs

A

simple graph in which every vertex is connected to every other vertex

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

bridges

A

when a connected graph becomes disconnected after an edge is removed

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

digraphs

A

have directed arcs

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

walks

A

a sequence of vertices for which each vertex is connected to the next, a walk may include repeated vertices or edges

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

path

A

a walk with no repeated edges or vertices

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

planar graphs

A

when it can be drawn in the plane without its edges crossing over

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

trail

A

a walk with no repeated edges

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

cycle

A

path that starts and ends at the same vertex

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

eulers rule

A

vertcies + faces = edges + 2

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

bipartite graph

A

no edges join vertices from the same group

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

completed bipartite

A

every memeber from each group is connected to every other member of the other group

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

hamiltonian

A

visit every vertex once, don’t mind if edges missed

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

directed graph

A

has an in and out degree from its vertext

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

Eulerian

A

travel every edge one
dont mind repeating vertcies

16
Q

semi

A

does not end and start at the same place

17
Q

closed trail

A

Starts finishes at same point does not repeat edges