Intro To Graph Theory Flashcards

1
Q

Does a set of objects have to be unique?

A

Yes

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

What is a multi set?

A

A multiset is a set of objects that are not unique

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

What is a binary relation set?

A

A set with a binary relationship {(v1,v2), (V2, V1)}

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

Can binary relations relate to themselves?

A

No

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

What does V stand for?

A

Vertex set, which is made up of vertices

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

What does E stand for?

A

Stands for edge. Is the line between the two vertices

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

How do you drawn vertices?

A

Circles or dots

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

How are edges drawn?

A

As a line connecting vertices

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

What is a network in relation to graph theory?

A

A network is a graph combined with a function that associates numbers to every edge. Just a graph with numbers on edges

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

What is a function?

A

A function is a relation between a set of inputs and a set of permissible outputs

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

What is deg(v)

A

The vertex degree

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

What is a vertex degree?

A

The vertex degree is a count of how many edges there are

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

What is Isomorphism?

A

Where two graphs are the same but drawn differently

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

What is a u-v walk?

A

Can follow the edges to all vertices.

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

What is a u-v trail?

A

a walk that doesn’t repeat any edges

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

What is a U-v path?

A

It doesn’t repeat any vertices

17
Q

What is a u-v circuit?

A

Links back up to a vertex without repeating an edge

18
Q

What is a u - v cycle?

A

When you can Link back up without repeating any vertices

19
Q

What makes a graph connected?

A

If every two vertices are connected

20
Q

What is a cut vertices?

A

A cut vertices is when adversity can be removed to split the graph into two subgraphs

21
Q

What is a digraph?

A

When the vertices isn’t reflected. The edge goes one way.

22
Q

What is an arc or a directed edge?

A

Is an edge that only goes one way represented by an arrow

23
Q

What is the directed walk?

A

A directed walk is when it is directed by arcs

24
Q

What is a sign Graph?

A

A directed network with function values of either positive one or negative one