The pancake graph of dimension "n", P n can be constructed recursively from n copies of P n − 1, by assigning a different element from the set as a suffix to each copy.
The pancake graph of dimension "n", P n is a regular graph with n! vertices, its degree is n − 1. It can be constructed recursively from n copies of P n − 1, by assigning a different element from the set as a suffix to each copy.