首页 | 本学科首页   官方微博 | 高级检索  
     


On Perfect 2‐Colorings of Johnson Graphs J(v, 3)
Authors:Alexander L. Gavrilyuk  Sergey V. Goryainov
Affiliation:1. Institute of Mathematics and Mechanics, , Yekaterinburg, 620990 Russia;2. Ural Federal University, , Yekaterinburg, 620990 Russia;3. Chelyabinsk State University, , Chelyabinsk, 454000 Russia
Abstract:We study the perfect 2‐colorings (also known as the equitable partitions into two parts or the completely regular codes with covering radius 1) of the Johnson graphs urn:x-wiley:10638539:media:jcd21327:jcd21327-math-0003. In particular, we classify all the realizable quotient matrices of perfect 2‐colorings for odd v. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 21: 232–252, 2013
Keywords:equitable partition  perfect coloring  completely regular code  Johnson graph  distance‐regular graph
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号