Standard

Perfect codes from PGL(2,5) in Star graphs. / Mogilnykh, Ivan Yurevich.

In: Сибирские электронные математические известия, Vol. 17, 2020, p. 534-539.

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

Harvard

Mogilnykh, IY 2020, 'Perfect codes from PGL(2,5) in Star graphs', Сибирские электронные математические известия, vol. 17, pp. 534-539. https://doi.org/10.33048/semi.2020.17.034

APA

Mogilnykh, I. Y. (2020). Perfect codes from PGL(2,5) in Star graphs. Сибирские электронные математические известия, 17, 534-539. https://doi.org/10.33048/semi.2020.17.034

Vancouver

Mogilnykh IY. Perfect codes from PGL(2,5) in Star graphs. Сибирские электронные математические известия. 2020;17:534-539. doi: 10.33048/semi.2020.17.034

Author

Mogilnykh, Ivan Yurevich. / Perfect codes from PGL(2,5) in Star graphs. In: Сибирские электронные математические известия. 2020 ; Vol. 17. pp. 534-539.

BibTeX

@article{41b4a5ab23c54630993e527849956b76,
title = "Perfect codes from PGL(2,5) in Star graphs",
abstract = "The Star graph Snis the Cayley graph of the symmetric group Sym„ with the generating set {(1 i) : 2 < i < n}. Arumugam and Kala proved that {π Є Sym„: π(1) = 1} is a perfect code in Snfor any n, n > 3. In this note we show that for any n, n > 6 the Star graph Sncontains a perfect code which is the union of cosets of the embedding of PGL(2,5) into Sym6.",
keywords = "Cayley graph, efficient dominating set, perfect code, projective linear group, Star graph, symmetric group, CAYLEY-GRAPHS",
author = "Mogilnykh, {Ivan Yurevich}",
note = "Funding Information: Mogilnykh, I. Yu., Perfect codes from PGL(2,5) in Star graphs. ⃝c 2020 Mogilnykh I.Yu. This work was partially supported by the Grant RFBR 18-01-00353A. Publisher Copyright: {\textcopyright} 2020 mogilnykh i.yu. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.",
year = "2020",
doi = "10.33048/semi.2020.17.034",
language = "English",
volume = "17",
pages = "534--539",
journal = "Сибирские электронные математические известия",
issn = "1813-3304",
publisher = "Sobolev Institute of Mathematics",

}

RIS

TY - JOUR

T1 - Perfect codes from PGL(2,5) in Star graphs

AU - Mogilnykh, Ivan Yurevich

N1 - Funding Information: Mogilnykh, I. Yu., Perfect codes from PGL(2,5) in Star graphs. ⃝c 2020 Mogilnykh I.Yu. This work was partially supported by the Grant RFBR 18-01-00353A. Publisher Copyright: © 2020 mogilnykh i.yu. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2020

Y1 - 2020

N2 - The Star graph Snis the Cayley graph of the symmetric group Sym„ with the generating set {(1 i) : 2 < i < n}. Arumugam and Kala proved that {π Є Sym„: π(1) = 1} is a perfect code in Snfor any n, n > 3. In this note we show that for any n, n > 6 the Star graph Sncontains a perfect code which is the union of cosets of the embedding of PGL(2,5) into Sym6.

AB - The Star graph Snis the Cayley graph of the symmetric group Sym„ with the generating set {(1 i) : 2 < i < n}. Arumugam and Kala proved that {π Є Sym„: π(1) = 1} is a perfect code in Snfor any n, n > 3. In this note we show that for any n, n > 6 the Star graph Sncontains a perfect code which is the union of cosets of the embedding of PGL(2,5) into Sym6.

KW - Cayley graph

KW - efficient dominating set

KW - perfect code

KW - projective linear group

KW - Star graph

KW - symmetric group

KW - CAYLEY-GRAPHS

UR - http://www.scopus.com/inward/record.url?scp=85097216888&partnerID=8YFLogxK

U2 - 10.33048/semi.2020.17.034

DO - 10.33048/semi.2020.17.034

M3 - Article

AN - SCOPUS:85097216888

VL - 17

SP - 534

EP - 539

JO - Сибирские электронные математические известия

JF - Сибирские электронные математические известия

SN - 1813-3304

ER -

ID: 26656058