Explicit Cayley covers of Kautz digraphs.

Brunat, Josep M.

Displaying similar documents to “Explicit Cayley covers of Kautz digraphs.”

A remark on almost Moore digraphs of degree three.

Baskoro, E.T., Miller, M., Širáň, J. (1997)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

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...

A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs.

Chwe, Byoung-Song (1994)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Reachability relations and the structure of transitive digraphs.

Seifter, Norbert, Trofimov, Vladimir I. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On graphs all of whose {C₃,T₃}-free arc colorations are kernel-perfect

Hortensia Galeana-Sánchez, José de Jesús García-Ruvalcaba (2001)

Discussiones Mathematicae Graph Theory

Similarity:

A digraph D is called a kernel-perfect digraph or KP-digraph when every induced subdigraph of D has a kernel. We call the digraph D an m-coloured digraph if the arcs of D are coloured with m distinct colours. A path P is monochromatic in D if all of its arcs are coloured alike in D. The closure of D, denoted by ζ(D), is the m-coloured digraph defined as follows: V( ζ(D)) = V(D), and A( ζ(D)) = ∪_{i} {(u,v) with colour i: there exists a monochromatic...