Number of Cycles
Each node on a graph has an order with is the number of its links. 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.