Graph Basics
What are the points/dots of a graph called
Vertices
What 2 things must a graph have
Vertices and edges
A tree contains no: (3 things)
Loops
cycles
multiple edges
A trail is a walk with:
no repeated edges
Square matrices have:
the same amount of rows and columns
A connected graph is when:
Every vertex is connected directly or indirectly
a tree with 3 vertices has ____ edges
2
A path is a walk with no repeated:
vertices
who won the 2007 AFL premiership
Geelong
The degree of a vertex represents:
The number of edges attached to a vertex
2 or more edges that connect the same vertices are called
Multiple edges
A spanning tree connects:
all vertices
A circuit must:
start and finish at the same vertex
United Arab Emirates
A loop contributes ___ edges to a vertex
2
2 graphs are isomorphic
they have the same number of edges & vertices
and
the vertices have the same degree and edges connect to same vertices
The numbers on a network can represent: (2 things)
Distance and time
The difference between an eularian circuit and an eularian trail is:
a EC must have all even degree vertices
How many students are at HR?
(400-500)
(500-600)
(600-700)
(700-800)
(800-900)
600-700
The sum of degrees is equal to ______ the number of edges
Twice
A planar graph must be draw with no:
intersections
The shortest path is used for finding:
shortest distance or time
A traversable graph must have either ____ or ______ vertices of odd degree
zero
two
My middle name is
Stephen