Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
From MaRDI portal
Publication:3540916
DOI10.1007/978-3-540-87448-5_2zbMath1167.05025OpenAlexW1541402617MaRDI QIDQ3540916
Ivan Yu. Mogilnykh, Sergei V. Avgustinovich
Publication date: 25 November 2008
Published in: Coding Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87448-5_2
Association schemes, strongly regular graphs (05E30) Coloring of graphs and hypergraphs (05C15) Combinatorial codes (94B25)
Related Items (18)
Perfect 3-colorings of the Johnson graph \(J(6, 3)\) ⋮ Perfect 2-colorings of the generalized Petersen graph ⋮ Completely regular codes in Johnson and Grassmann graphs with small covering radii ⋮ Perfect 2-colorings of the Johnson graph \(J(9, 4)\) ⋮ Perfect 2-colorings of the generalized Petersen graph GP(n,3) ⋮ Perfect 2-coloring of the quartic graphs with order at most 8 ⋮ On completely regular codes with minimum eigenvalue in geometric graphs ⋮ Perfect 2‐colorings of Hamming graphs ⋮ On weight distributions of perfect colorings and completely regular codes ⋮ Unnamed Item ⋮ Perfect 2-colorings of the cubic graphs of order less than or equal to 10 ⋮ On Perfect 2‐Colorings of Johnson Graphs J(v, 3) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Perfect 3-colorings on 6-regular graphs of order 9 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Perfect 3-colorings of the cubic graphs of order 10
Cites Work
- Unnamed Item
- Unnamed Item
- On new completely regular \(q\)-ary codes
- On the error-free filtering of finite-state singular processes under dependent distortions
- Perfect Constant-Weight Codes
- Perfect Single Error-Correcting Codes in the Johnson Scheme
- Completely regular designs
- On perfect codes and related concepts
This page was built for publication: Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
