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_2zbMATH Open1167.05025OpenAlexW1541402617MaRDI QIDQ3540916FDOQ3540916
Authors: Sergey Avgustinovich, Ivan Yu. Mogilnykh 
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
Recommendations
- Perfect 2-colorings of the Johnson graphs \(J(8,3)\) and \(J(8,4)\)
- On nonexistence of some perfect 2-colorings of Johnson graphs
- On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
- On the regularity of perfect 2-colorings of the Johnson graph
- Perfect \(3\)-colorings of the Johnson graphs \(J(4,2)\), \(J(5,2)\), \(J(6,2)\) and Petersen graph.
Association schemes, strongly regular graphs (05E30) Coloring of graphs and hypergraphs (05C15) Combinatorial codes (94B25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect Constant-Weight Codes
- Perfect Single Error-Correcting Codes in the Johnson Scheme
- On perfect codes and related concepts
- Completely regular designs
- On new completely regular \(q\)-ary codes
- On the error-free filtering of finite-state singular processes under dependent distortions
Cited In (21)
- Perfect 3-colorings of the Johnson graph \(J(6, 3)\)
- On the regularity of perfect 2-colorings of the Johnson graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect 2-colorings of the cubic graphs of order less than or equal to 10
- Perfect 3-colorings of the cubic graphs of order 10
- Title not available (Why is that?)
- Perfect 2-colorings of the generalized Petersen graph GP(n,3)
- On completely regular codes with minimum eigenvalue in geometric graphs
- Title not available (Why is that?)
- Completely regular codes in Johnson and Grassmann graphs with small covering radii
- Perfect 2-colorings of the generalized Petersen graph
- Perfect 2-colorings of the Johnson graph \(J(9, 4)\)
- Perfect 2-colorings of the Johnson graphs \(J(8,3)\) and \(J(8,4)\)
- Perfect 2‐colorings of Hamming graphs
- Perfect 2-coloring of the quartic graphs with order at most 8
- On weight distributions of perfect colorings and completely regular codes
- On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
- Symmetric perfect 2-colorings of \(J(10,3)\)
- Title not available (Why is that?)
- Perfect 3-colorings on 6-regular graphs of order 9
This page was built for publication: Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540916)
