Flashcards in D1 Deck (18):
Diagram involving a set of points and interconnecting lines
A point on a graph
A connecting line on a graph between two points
Line connecting a vertex to itself
Two edges connecting two points
No loops or multiple edges
Possible to travel from any vertex to any other vertex (you can go via other vertices)
The no. edges arriving at a vertex
There is an edge connecting every possible pair of vertices
Kn is the complete graph with n vertices. How many edges does it have?
What does an adjacency matrix show?
the number of direct routes from one vertex to another
Graph where each edge has an associated number it's 'weight'
What does a distance matrix show?
the weights of the routes between one vertex to another
sequence of connected edges
Walk where you can't use any edge more than once
Trail that returns to the starting vertex
Trail that doesn't revisit any vertices