<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">sibsutis-310</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>Спектры и диаметры графов Кэли некоторых конечных групп</article-title><trans-title-group xml:lang="en"><trans-title>Cayley graphs spectra and diameters of some finite groups</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Овчаренко</surname><given-names>А. Ю.</given-names></name><name name-style="western" xml:lang="en"><surname>Ovcharenko</surname><given-names>A. ..</given-names></name></name-alternatives><email xlink:type="simple">shmatova aaa@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>СибГУТИ</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2018</year></pub-date><pub-date pub-type="epub"><day>24</day><month>10</month><year>2022</year></pub-date><volume>0</volume><issue>3</issue><fpage>45</fpage><lpage>61</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Овчаренко А.Ю., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Овчаренко А.Ю.</copyright-holder><copyright-holder xml:lang="en">Ovcharenko A...</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://vestnik.sibsutis.ru/jour/article/view/310">https://vestnik.sibsutis.ru/jour/article/view/310</self-uri><abstract><p>В работе рассматривается задача поиска целочисленных графов Кэли на знакопеременных группах An при n = 4,5,6,7,8 для различных наборов порождающих, а также проверена гипотеза о целочисленности графов Кэли конечных групп, порождённых инвариантным множеством инволюций. Эта гипотеза проверена для групп диэдра D2n при n = 6,7,...,132, линейных групп L2(n) при n = 5,7,8,9,11,13 и симметрических групп Sn при n = 3,4,5,6. Представлены диаметры графов Кэли для упомянутых групп.</p></abstract><trans-abstract xml:lang="en"><p>The problem of finding integral Cayley graphs for alternating groups An, where n = 4,5,6,7,8, with different generating sets is considered and also the hypothesis of the integrality of Cayley graphs of finite group generated with an invariant set of involutions is tested. The hypothesis is tested for Dihedral groups D2n with n = 6,7,...,132, linear groups L2(n) with n = 5,7,8,9,11,13, and symmetric groups Sn with n = 3,4,5,6. The diameters of Cayley graphs for these groups are presented.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>множество порождающих</kwd><kwd>инволюция</kwd><kwd>спектр</kwd><kwd>граф Кэли</kwd><kwd>знакопеременная группа</kwd><kwd>группа диэдра</kwd><kwd>линейная группа</kwd><kwd>симметрическая группа</kwd><kwd>диаметр</kwd></kwd-group><kwd-group xml:lang="en"><kwd>generating set</kwd><kwd>involution</kwd><kwd>spectrum</kwd><kwd>Cayley graph</kwd><kwd>alternating group</kwd><kwd>dihedral group</kwd><kwd>linear group</kwd><kwd>symmetric group</kwd><kwd>diameter</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Akers S., Krishnamurthy B. A group theoretic model for symmetric interconnection networks // International Conference on Parallel Processing, 1986. P. 216-223.</mixed-citation><mixed-citation xml:lang="en">Akers S., Krishnamurthy B. A group theoretic model for symmetric interconnection networks // International Conference on Parallel Processing, 1986. P. 216-223.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Harary F. and Schwenk A. J. Which graphs have integral spectra? Graphs and Combinatorics. Springer-Verlag, Berlin, 1974. P. 45-51</mixed-citation><mixed-citation xml:lang="en">Harary F. and Schwenk A. J. Which graphs have integral spectra? Graphs and Combinatorics. Springer-Verlag, Berlin, 1974. P. 45-51</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Biggs N. Algebraic graph theory. Cambridge University Press, 1974.</mixed-citation><mixed-citation xml:lang="en">Biggs N. Algebraic graph theory. Cambridge University Press, 1974.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">GAP: Groups, algorithms, and programming. URL: http://www/gap-system.org.</mixed-citation><mixed-citation xml:lang="en">GAP: Groups, algorithms, and programming. URL: http://www/gap-system.org.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Кузнецов А. А. Графы Кэли бернсайдовых групп периода 3 // Сибирские электронные математические известия. 2015. Т. 12. С. 248-254.</mixed-citation><mixed-citation xml:lang="en">Кузнецов А. А. Графы Кэли бернсайдовых групп периода 3 // Сибирские электронные математические известия. 2015. Т. 12. С. 248-254.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
