Digraphs on permutations

DOI10.1016/S0012-365X(96)00318-4zbMath0885.05069OpenAlexW2086081172MaRDI QIDQ1377815

M. L. Fiol, Miquel Àngel Fiol, Josep M.Brunat Blay

Publication date: 24 March 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00318-4

zbMATH Keywords

digraphsCayley colour graph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

On networks with order close to the Moore bound ⋮ Turán problems for \(k\)-geodetic digraphs ⋮ Hamiltonicity of digraphs for universal cycles of permutations ⋮ De Bruijn and Kautz digraphs of a rooted tree

Cites Work

• Vertex-symmetric digraphs with small diameter
• Cycle prefix digraphs for symmetric interconnection networks
• On a Class of Fixed-Point-Free Graphs
• Line Digraph Iterations and the (d, k) Digraph Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Digraphs on permutations