Digraphs on permutations

J. M. Brunat; M. A. Fiol; M. L. Fiol

doi:https://doi.org/10.1016/S0012-365X(96)00318-4

Digraphs on permutations

J. M. Brunat, M. A. Fiol, M. L. Fiol

Department of Teaching of Mathematics and Experimental Sciences

Research output: Contribution to journal › Article › Research › peer-review

3 Citations (Scopus)

Abstract

We study a family of vertex transitive digraphs whose vertices represent the k-permutations of n elements. After showing some general properties, we concentrate upon the study of the symmetry of these digraphs. By using some distance-related properties, their automorphism groups are characterized. We also characterize those digraphs which are Cayley digraphs. Finally, the diameter of these digraphs is obtained for values of n and k which include almost all values for which they are Cayley digraphs.

Original language	English
Pages (from-to)	73-86
Journal	Discrete Mathematics
Volume	174
DOIs	https://doi.org/10.1016/S0012-365X(96)00318-4
Publication status	Published - 15 Sep 1997

Access to Document

https://doi.org/10.1016/S0012-365X(96)00318-4

Fingerprint Dive into the research topics of 'Digraphs on permutations'. Together they form a unique fingerprint.

Cite this

@article{9f4b51a4660a4eb9918e777854acde88,

title = "Digraphs on permutations",

abstract = "We study a family of vertex transitive digraphs whose vertices represent the k-permutations of n elements. After showing some general properties, we concentrate upon the study of the symmetry of these digraphs. By using some distance-related properties, their automorphism groups are characterized. We also characterize those digraphs which are Cayley digraphs. Finally, the diameter of these digraphs is obtained for values of n and k which include almost all values for which they are Cayley digraphs.",

author = "Brunat, {J. M.} and Fiol, {M. A.} and Fiol, {M. L.}",

year = "1997",

month = sep,

day = "15",

doi = "https://doi.org/10.1016/S0012-365X(96)00318-4",

language = "English",

volume = "174",

pages = "73--86",

journal = "Discrete Mathematics",

issn = "0012-365X",

}

TY - JOUR

T1 - Digraphs on permutations

AU - Brunat, J. M.

AU - Fiol, M. A.

AU - Fiol, M. L.

PY - 1997/9/15

Y1 - 1997/9/15

N2 - We study a family of vertex transitive digraphs whose vertices represent the k-permutations of n elements. After showing some general properties, we concentrate upon the study of the symmetry of these digraphs. By using some distance-related properties, their automorphism groups are characterized. We also characterize those digraphs which are Cayley digraphs. Finally, the diameter of these digraphs is obtained for values of n and k which include almost all values for which they are Cayley digraphs.

AB - We study a family of vertex transitive digraphs whose vertices represent the k-permutations of n elements. After showing some general properties, we concentrate upon the study of the symmetry of these digraphs. By using some distance-related properties, their automorphism groups are characterized. We also characterize those digraphs which are Cayley digraphs. Finally, the diameter of these digraphs is obtained for values of n and k which include almost all values for which they are Cayley digraphs.

U2 - https://doi.org/10.1016/S0012-365X(96)00318-4

DO - https://doi.org/10.1016/S0012-365X(96)00318-4

M3 - Article

VL - 174

SP - 73

EP - 86

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

ER -