Number of Cycles

Each node in these graphs has an order. Graph A is a simple graph with no nodes having an order higher than 2. Graph C is a perfect hub and spoke graph where the hub has an order which is equal to the summation of the orders of all the spokes.

Home | Contents | Media | Glossary | Links | About | Contact | Purchase

Copyright © 1998-2012, Dr. Jean-Paul Rodrigue, Dept. of Global Studies & Geography, Hofstra University, New York, USA.
This material (including graphics) cannot be copied or redistributed, in whole or in part, in ANY FORM (printed or electronic) and on ANY MEDIA. For specific uses permission MUST be requested and the material must be cited.