On perfect 2-colorings of Johnson graphs J(v, 3)

DOI10.1002/JCD.21327MaRDI QIDQ4929281zbMATH OpenOpenAlexFDO

Authors Alexander L. Gavrilyuk, Sergey Viktorovich Goryainov

Publication date 13 June 2013

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.21327

zbMATH Keywords

completely regular codedistance-regular graphequitable partitionJohnson graphperfect coloring

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On nonexistence of some perfect 2-colorings of Johnson graphs
• Perfect 2-colorings of the Johnson graphs J(8,3) and J(8,4)
• Perfect 3-colorings of the Johnson graphs J(4,2), J(5,2), J(6,2) and Petersen graph.
• Perfect 2-colorings of the cubic graphs of order less than or equal to 10
• Perfect 2-colorings of the Johnson graph \(J(9, 4)\)

Cites work

• Completely regular codes
• Completely regular designs
• Completely regular designs of strength one
• Cycle-balance conditions for distance-regular graphs
• scientific article; zbMATH DE number 5379405 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Induced perfect colorings
• On the existence of 2-designs Slambda(2,3,v) without repeated blocks
• On the Nonexistence of Perfect Codes over Finite Fields
• On the regularity of perfect 2-colorings of the Johnson graph
• Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
• Perfect Single Error-Correcting Codes in the Johnson Scheme

Cited in

(33)

• Perfect 2-colorings of the Johnson graph \(J(9, 4)\)
• Subgroup regular sets in Cayley graphs
• Perfect 2-coloring of the quartic graphs with order at most 8
• The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances
• Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs
• Perfect 2-colorings of the Grassmann graph of planes
• Perfect 3-colorings on 6-regular graphs of order 9
• MMS-type problems for Johnson scheme
• Degree 2 Boolean functions on Grassmann graphs
• Perfect 2-colorings of the Johnson graphs J(8,3) and J(8,4)
• Perfect 2-colorings of the generalized Petersen graph
• Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
• Cameron-Liebler line classes in PG(n,4)
• scientific article; zbMATH DE number 7009673 (Why is no real title available?)
• Perfect 3-colorings of the Johnson graphs J(4,2), J(5,2), J(6,2) and Petersen graph.
• Perfect colorings of regular graphs
• Perfect 3-colorings of the cubic graphs of order 10
• Perfect 2-colorings of the generalized Petersen graph \(GP(n,3)\)
• Perfect 4-colorings of the 3-regular graphs of order at most 8
• scientific article; zbMATH DE number 7289053 (Why is no real title available?)
• Perfect 2-colorings of the cubic graphs of order less than or equal to 10
• On completely regular codes with minimum eigenvalue in geometric graphs
• Perfect 2‐colorings of Hamming graphs
• On regular sets in Cayley graphs
• Designs for half-diallel experiments with commutative orthogonal block structure
• On degree-3 and (n - 4)-correlation-immune perfect colorings of n-cubes
• Symmetric perfect 2-colorings of \(J(10,3)\)
• Equitable 2-partitions of the Johnson graphs J(n,3)
• Perfect colourings of simplices and hypercubes in dimension four and five with few colours
• Regular sets of generalized Petersen graphs
• Perfect 3-colorings of the Johnson graph \(J(6, 3)\)
• Induced perfect colorings
• On the regularity of perfect 2-colorings of the Johnson graph

This page was built for publication: On perfect 2-colorings of Johnson graphs \(J(v, 3)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4929281)