Subset powers of directed cycles
Combinatorics
2013-05-14 v1
Abstract
For any directed graph G with vertex set V, the graph G^(d) is said to be a subset power of G and is defined to have vertex set equal to the set of d-element subsets of V; in G^(d), there is an edge from A to B if and only if we can label the elements of A and B such that there is an edge in G between each pair of corresponding elements. We determine the complete cycle structure of C^(d), where C is a directed cycle of length l.
Keywords
Cite
@article{arxiv.1305.2543,
title = {Subset powers of directed cycles},
author = {Daniel Pragel},
journal= {arXiv preprint arXiv:1305.2543},
year = {2013}
}