On a Complete Graph with N Vertices, There Are N!/2

question 32

Multiple Choice

On a complete graph with n vertices, there are n!/2 Hamilton circuits starting at a given vertex, not counting reverse routes. If a traveling salesman wanted to make deliveries to nine cities in a region, how many possible routes would he have to check to find the shortest one?

• A)2520
• B)20,160
• C)181,440
• D)1,814,400

---

Definitions:

Process Costing

A costing method used in manufacturing where costs are assigned to batches or production runs, typically for homogeneous products.

Cost of Goods Completed

This term refers to the total cost incurred to manufacture products that have been completed during a specific period.

Processing Department

A division within a factory where a specific type of production activity or process takes place.

Work in Process

Inventory category referring to goods that are in the process of being manufactured but are not yet completed.