Vocab 1

Question 0

Arc

Answer 0

Edge

Question 1

Node

Answer 1

Vertex

Question 2

Order

Answer 2

Number of arcs meeting at a node

Question 3

Even node

Answer 3

Has an even order

Question 4

Odd node

Answer 4

Has an odd order

Question 5

Multiple Arcs

Answer 5

More than one arc connecting a pair of nodes

Question 6

Loop

Answer 6

An arc connecting a node to itself

Question 7

Simple Graph

Answer 7

A graph without loops or multiple arcs

Question 8

Complete Graph

Answer 8

A simple graph such that each of its nodes is directly connected by an arc to every other node

Question 9

Subgraph of G

Answer 9

A graph whose nodes and arcs are all in the graph G

Question 10

Bipartite Graph

Answer 10

A graph with two sets of nodes such that arcs only connect nodes from one set to the other

Question 11

Complete Bipartite Graph

Answer 11

A bipartite graph such that each of its nodes is directly connected by an arc to every other node.

Question 12

Trail

Answer 12

A sequence of arcs such that the end node of one arc is the start node of the next.

Question 13

Path

Answer 13

A trail with the restriction that no node is passed more than once

Question 14

Closed trail

Answer 14

A trail where the initial and final nodes are the same

Question 15

Cycle

Answer 15

A closed trail where only the initial and final nodes are the same

Question 16

Eulerian graph

Answer 16

A connected graph which has a closed trail containing every arc precisely once, and has nodes which all have an even order