Displaying similar documents to “Automorphism groups of wreath product digraphs.”

Frucht’s Theorem for the Digraph Factorial

Richard H. Hammack (2013)

Discussiones Mathematicae Graph Theory

Similarity:

To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G. A new operation on digraphs was introduced recently as an aid in solving certain questions regarding cancellation over the direct product of digraphs. Given a digraph A, its factorial A! is certain digraph whose vertex set is the permutations of V (A). The arc set E(A!) forms...

Distinguishing maps.

Tucker, Thomas W. (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Symmetry breaking in graphs.

Albertson, Michael O., Collins, Karen L. (1996)

The Electronic Journal of Combinatorics [electronic only]

Similarity: