Graph Theory Lessons
Lesson
5: Regular Graphs
A graph in which every vertex has the same degree
is called a regular graph. If every vertex
has degree r then we say the graph is regular of degree r
. All null graphs are regular of degree zero.
-
If a graph with n vertices is regular of degree r, what is the sum of the degrees of the vertices?
- If a graph with n vertices is regular of degree r, how many edges does it have? (Use your answer to question 1 of
Exercise 2)
-
Look at the statistics of a few
complete graphs. Is the complete graph Kn regular, and if so of what degree?
-
From your answer to part 1 and 3, what is the sum of degrees
for Kn?
-
From your answers to questions 4 and 2, how many edges will
Kn have?
-
A trivalent graph
is one that is regular of degree 3. Which of the complete graphs is/are
trivalent?
-
A very well known graph is the Petersen Graph.
It is the graph that this program is named after.
|
Fig. 7, The
Petersen Graph
|
To get the Petersen Graph click Graph
and then Petersen. Is the Petersen Graph a regular graph? Is it
trivalent?
-
Sketch a simple
trivalent graph with six vertices.
e-mail: C.
Mawata
© C. Mawata