pre sixth definitions

Question 1

vertices/nodes

Answer 1

points on a graph connected by edges

Question 2

edges/arcs

Answer 2

the line that connects a vertex to another

Question 3

order of a vertex

Answer 3

the number of edges connected to it

Question 4

loop

Answer 4

an edge that starts and finishes at the same vertex

Question 5

simple graph

Answer 5

a graph that has no loops or multiarcs

Question 6

connected

Answer 6

when there is a path between 2 vertices

Question 7

complete graph

Answer 7

a graph where every vertex is connected to every other vertex directly by an edge

Question 8

graph

Answer 8

a set of vertices and a set of edges that connect them

Question 9

network

Answer 9

a weighted graph

Question 10

digraph

Answer 10

a graph where the arcs have a direction associated with them

Question 11

isomorphic graph

Answer 11

graphs that show the same information but are drawn differently

Question 12

path

Answer 12

a finite sequence of edges such that the end vertex of one edge in the sequence is the start vertex of the next and in which no vertex appears more than once

Question 13

walk

Answer 13

a path where a vertex can be revisited

Question 14

cycle/circuit

Answer 14

a closed path so the starting vertex of the first edge is the end vertex of the final edge

Question 15

tree

Answer 15

a connected graph with no cycles

Question 16

spanning tree

Answer 16

a graph G has a sub graph of G and a tree that connects all its vertices

Question 17

minimum spanning tree

Answer 17

a spanning tree such that the total length of its arcs is as small as possible