On Perfect 2‐Colorings of Johnson Graphs J(v, 3)

DOI10.1002/jcd.21327zbMath1266.05033OpenAlexW1954638097MaRDI QIDQ4929281

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

distance-regular graphJohnson graphcompletely regular codeequitable partitionperfect coloring

Mathematics Subject Classification ID

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

Related Items (19)

Perfect 3-colorings of the Johnson graph \(J(6, 3)\) ⋮ MMS-type problems for Johnson scheme ⋮ Perfect 2-colorings of the generalized Petersen graph ⋮ Perfect 2-colorings of the Johnson graph \(J(9, 4)\) ⋮ Subgroup regular sets in Cayley graphs ⋮ Perfect 2-colorings of the generalized Petersen graph GP(n,3) ⋮ 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 ⋮ On completely regular codes with minimum eigenvalue in geometric graphs ⋮ Cameron-Liebler line classes in \(PG(n,4)\) ⋮ Degree 2 Boolean functions on Grassmann graphs ⋮ Perfect 2‐colorings of Hamming graphs ⋮ Perfect 2-colorings of the cubic graphs of order less than or equal to 10 ⋮ Unnamed Item ⋮ Perfect 3-colorings on 6-regular graphs of order 9 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Perfect colorings of regular graphs ⋮ Perfect 3-colorings of the cubic graphs of order 10

Cites Work

• Unnamed Item
• Unnamed Item
• Induced perfect colorings
• On the regularity of perfect 2-colorings of the Johnson graph
• On the existence of 2-designs Slambda(2,3,v) without repeated blocks
• Completely regular codes
• Completely regular designs of strength one
• Cycle-balance conditions for distance-regular graphs
• Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
• Perfect Single Error-Correcting Codes in the Johnson Scheme
• Completely regular designs
• On the Nonexistence of Perfect Codes over Finite Fields

This page was built for publication: On Perfect 2‐Colorings of Johnson Graphs J(v, 3)