Constructing a complete graph of degree N

Implementation is achieved as follows. 1. Select the number of vertices using the slider. 2. For each value of the slider 'skip', drag the slider 'first' through all of its values (this is accomplished most easily using the left-right arrows) 3. A colorful graph results when one occasionally changes the color of the first segment when 'skip' is incremented. Students can be challenged to determine the number of segments for various values of N (number of vertices).

 

Steven Blumsack

 
Tipus de material
Construcció dinàmica
Etiquetes
art  complete  graph 
Grup de destinació (edats)
15 – 18
Idioma
English (United Kingdom)
 
 
Versió del GeoGebra
4.0
Visites
2684
Poseu-vos en contacte amb l'autor del material.
 
 
© 2026 International GeoGebra Institute