Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://elar.urfu.ru/handle/10995/103154
Полная запись метаданных
Поле DCЗначениеЯзык
dc.contributor.authorEfimov, K. S.en
dc.contributor.authorMakhnev, A. A.en
dc.date.accessioned2021-08-31T15:07:53Z-
dc.date.available2021-08-31T15:07:53Z-
dc.date.issued2020-
dc.identifier.citationEfimov K. S. Distance-regular graph with intersection array {27, 20, 7; 1, 4, 21} does not exist / K. S. Efimov, A. A. Makhnev. — DOI 10.15826/UMJ.2020.2.006 // Ural Mathematical Journal. — 2020. — Vol. 6. — Iss. 2. — P. 63-67.en
dc.identifier.issn24143952-
dc.identifier.otherFinal2
dc.identifier.otherAll Open Access, Gold3
dc.identifier.otherhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85099576176&doi=10.15826%2fUMJ.2020.2.006&partnerID=40&md5=09af4e270229e3c69ffd88bc6e65a2fd
dc.identifier.otherhttps://umjuran.ru/index.php/umj/article/download/292/pdfm
dc.identifier.urihttp://elar.urfu.ru/handle/10995/103154-
dc.description.abstractIn the class of distance-regular graphs of diameter 3 there are 5 intersection arrays of graphs with at most 28 vertices and noninteger eigenvalue. These arrays are {18, 14, 5; 1, 2, 14}, {18, 15, 9; 1, 1, 10}, {21, 16, 10; 1, 2, 12}, {24, 21, 3; 1, 3, 18}, and {27, 20, 7; 1, 4, 21}. Automorphisms of graphs with intersection ar- rays {18, 15, 9; 1, 1, 10} and {24, 21, 3; 1, 3, 18} were found earlier by A.A. Makhnev and D.V. Paduchikh. In this paper, it is proved that a graph with the intersection array {27, 20, 7; 1, 4, 21} does not exist. © 2020, Krasovskii Institute of Mathematics and Mechanics. All rights reserved.en
dc.description.sponsorshipThis work was supported by RFBR and NSFC (project No. 20-51-53013).en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherKrasovskii Institute of Mathematics and Mechanicsen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceUral Math. J.2
dc.sourceUral Mathematical Journalen
dc.subjectAUTOMORPHISMen
dc.subjectDISTANCE-REGULAR GRAPHen
dc.subjectGRAPH Г WITH STRONGLY REGULAR GRAPH Г3en
dc.titleDistance-regular graph with intersection array {27, 20, 7; 1, 4, 21} does not existen
dc.typeArticleen
dc.typeinfo:eu-repo/semantics/articleen
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.rsi45001360-
dc.identifier.doi10.15826/UMJ.2020.2.006-
dc.identifier.scopus85099576176-
local.contributor.employeeEfimov, K.S., Ural State University of Economics, 62 March 8th Str, Ekaterinburg, 620144, Russian Federation, Ural Federal University, 19 Mira Str, Ekaterinburg, 620002, Russian Federation
local.contributor.employeeMakhnev, A.A., Ural Federal University, 19 Mira Str, Ekaterinburg, 620002, Russian Federation, Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, 16 S. Kovalevskaya Str, Ekaterinburg, 620108, Russian Federation
local.description.firstpage63-
local.description.lastpage67-
local.issue2-
local.volume6-
local.contributor.departmentUral State University of Economics, 62 March 8th Str, Ekaterinburg, 620144, Russian Federation
local.contributor.departmentUral Federal University, 19 Mira Str, Ekaterinburg, 620002, Russian Federation
local.contributor.departmentKrasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, 16 S. Kovalevskaya Str, Ekaterinburg, 620108, Russian Federation
local.identifier.pure20513126-
local.identifier.pure51895165-7025-4ff6-8d8f-a04dc0f39f3auuid
local.identifier.eid2-s2.0-85099576176-
local.fund.rffi20-51-53013-
Располагается в коллекциях:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Файлы этого ресурса:
Файл Описание РазмерФормат 
2-s2.0-85099576176.pdf103,31 kBAdobe PDFПросмотреть/Открыть


Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.