graph_exponentiation (591B)
1 # Graph exponentiation 2 3 for an [integer] k and [graph] G, the graph exponentiation of G by k is the graph with same [vertices] with an edge from u to v if there is a path of length at most k from u to v 4 - related to [exponentiation] of [adjacency_matrix] 5 6 - [graph_cube] for exponentiation by 3 7 - [graph_square] for exponentiation by 2 8 9 Uses: 10 11 - for [hamiltonian_cycle], cf [hamiltonian_cycle_cube] 12 - for [graph_coloring] 13 - cf https://cstheory.stackexchange.com/questions/51269/upper-bound-for-distance-two-chromatic-number-in-terms-of-maximum-degree 14 15 See also: [Moore_graph] 16 17 Up: [graph]