Types Of Grpahs

Question 1

What is a simple graph?

Answer 1

No loops / going back on itself

Question 2

What is a complete graph?

Answer 2

When all if the vertices connect to all of the other vertices

Question 3

What is a connected graph?

Answer 3

When all of the vertices are connected (no islands)

Question 4

What is a disconnected graph?

Answer 4

When some vertices are not connected (islands)

Question 5

What is a subgraph?

Answer 5

A part of a existing graph with no new vertices

Question 6

What is a directed graph?

Answer 6

When the graph has arrows

Question 7

What is a bipartite graph?

Answer 7

When there are two sides and they connect to each other (can be more on one side).

They can’t connect to their own side, just the opposite side

Question 8

What is a Hamiltonian circuit?

Answer 8

Visit all vertices in a loop, end at the same place

you can go on the same edge over and over if u want

Question 9

What is a Eulerian Graph?

Answer 9

It visits each EDGE of the graph once.

all even OR two odd (start and finish)

Question 10

What is are vertices/vertex?

Answer 10

Dots

Question 11

What are edges/arcs?

Answer 11

Lines

Question 12

Speed = ?

Answer 12

Speed = Distance / Time

Question 13

Distance = ?

Answer 13

Speed x Time

Question 14

Time = ?

Answer 14

Distance / Speed

Question 15

What is the triangle thingy?

Answer 15

D on top
S to the left
T on the right

Question 16

What is a walk?

Answer 16

Do legit whatever u want

Question 17

What is open in graph language?

Answer 17

Start and end at different places

Question 18

What is closed in graph language?

Answer 18

Start and end at the same place

Question 19

What is a trail?

Answer 19

Cannot repeat edges (tnt trail)

Question 20

What is a path?

Answer 20

Don’t repeat ANYTHING

Path of DOOM

Question 21

What is a circuit?

Answer 21

A closed trail (wires cross, go kaBOOM ZAP!!)

Question 22

What is a cycle?

Answer 22

Closed path DOOM!!!! come back tho. Roller coaster doom ride.

Question 23

Circuit and Cycle must Start and Finish at the Same Spot

Answer 23

CURCUIT AND CYCLE MUST START AND FINISH AT THE SAME SPOT!!

Question 24

What is a Hamiltonian graph?

Answer 24

it visits each VERTEX once

Question 25

How do u do the Hungarian algorithm after rows and columns?

Answer 25

Minus the uncovered ones and plus the ones covered twice

Question 26

What does a Euler graph need to exist?

Answer 26

All even OR two odd

Question 27

What is a planar graph?

Answer 27

No crossing over

Question 28

What is a complete graph?

Answer 28

Everything connected to each other

Question 29

What is a bipartite graph?

Answer 29

two distinct sides

Question 30

What is a sub graph?

Answer 30

A part of an existing graph

Question 31

What is a circuit or cycle?

Answer 31

Start and end at the same spot

Question 32

What do you need for a graph to be Eulerian?

Answer 32

• All vertices EVEN degree

- Closed trail exists

Question 33

What does a graph need to be semi Eulerian?

Answer 33

• ONLY 2 veritcies with odd degrees
• an open trail exists
• The eulerian path must start and finish on the od degrees

Question 34

What is an Eulerian path?

Answer 34

Goes to each Edge once. DOOM!! don’t repeat AnYtHiNg!1!1!!!

Question 35

What is an Hamiltonian Path?

Answer 35

Goes to each of the Vertices once. Path =… DOOOOM! dont repeat!!!!!