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

 
Anyagtípus
Anyag
Címkék
art  complete  graph 
Célcsoport (életkor)
15 – 18
Nyelv
English (United Kingdom)
 
 
GeoGebra verzió
4.0
Megtekintések
2573
Contact author of resource
 
 
© 2025 International GeoGebra Institute