Graphs and networks

Question 1

Isomorphic

Answer 1

2 graphs that are the same

Question 2

Bipartite graph

Answer 2

A connected graph with 2 sets of vertices where no connections exist within each set

Question 3

Degree

Answer 3

The number of edges connected to a vertex

Question 4

Eulerian

Answer 4

A closed path that covers every edge exactly once

Question 5

Semi-Eulerian

Answer 5

Has 2 odd vertices and the rest even

Question 6

Cycle

Answer 6

A closed path

Question 7

Weight

Answer 7

A network contains this on each edge

Question 8

Node

Answer 8

A Point on a graph

Question 9

Arc

Answer 9

The line connecting two points

Question 10

Complete Graph

Answer 10

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

Question 11

Tree

Answer 11

A connected graph with no cycles

Question 12

Edge

Answer 12

The line connecting 2 points

Question 13

Order

Answer 13

The number of edges connected to a vertex

Question 14

Complement graph

Answer 14

The inverse of a graph. Contains only the edges needed to complete original graph.

Question 15

Connected graph

Answer 15

A graph where a path exists between any two vertices

Question 16

Walk

Answer 16

A sequence of edges

Question 17

Subgraph

Answer 17

Made up of a smaller set of vertices and edges taken from another graph

Question 18

Planar Graph

Answer 18

A type of graph that can be drawn so that none of the arcs cross

Question 19

Trail

Answer 19

A walk where none of the edges are repeated

Question 20

Incidence Matrix

Answer 20

An array describing the relationship between vertices and adjacent edges

Question 21

Simple graph

Answer 21

A graph with no multiple edges or loops

Question 22

Adjacency matrix

Answer 22

An array indicating whether pairs of vertices are adjacent or not.

Question 23

Even Vertices

Answer 23

In a Eulerian graph, we have to have all of them as this

Question 24

Path

Answer 24

A trail where none of the vertices are repeated

Question 25

Network

Answer 25

A graph with weighted edges

Question 26

Subdivision

Answer 26

A graph where edges have been divided by new vertices

Question 27

Hamiltonian Cycle

Answer 27

Visit each vertex once and return back to the start gives you this.

Question 28

Regular graph

Answer 28

The order of each of the graphs is the same