{"title":"On completely regular codes with minimum eigenvalue in geometric graphs","authors":"I. Mogilnykh, K. Vorob'ev","doi":"10.48550/arXiv.2210.11184","DOIUrl":null,"url":null,"abstract":"We prove that any completely regular code with minimum eigenvalue in any geometric graph G corresponds to a completely regular code in the clique graph of G. Studying the interrelation of these codes, a complete characterization of the completely regular codes in the Johnson graphs J(n,w) with covering radius w-1 and strength 1 is obtained. In particular this result finishes a characterization of the completely regular codes in the Johnson graphs J(n,3). We also classify the completely regular codes of strength 1 in the Johnson graphs J(n,4) with only one case for the eigenvalues left open.","PeriodicalId":21749,"journal":{"name":"SIAM J. Discret. Math.","volume":"46 1","pages":"113357"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM J. Discret. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2210.11184","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We prove that any completely regular code with minimum eigenvalue in any geometric graph G corresponds to a completely regular code in the clique graph of G. Studying the interrelation of these codes, a complete characterization of the completely regular codes in the Johnson graphs J(n,w) with covering radius w-1 and strength 1 is obtained. In particular this result finishes a characterization of the completely regular codes in the Johnson graphs J(n,3). We also classify the completely regular codes of strength 1 in the Johnson graphs J(n,4) with only one case for the eigenvalues left open.