Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)

DOI10.1007/978-3-540-87448-5_2MaRDI QIDQ3540916zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Association schemes, strongly regular graphs (05E30) Combinatorial codes (94B25)

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.

Cites work

• Completely regular designs
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• On new completely regular q-ary codes
• On perfect codes and related concepts
• 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

Cited in

(25)

• Completely regular codes in Johnson and Grassmann graphs with small covering radii
• Perfect 2-colorings of the Johnson graph \(J(9, 4)\)
• Perfect 2-coloring of the quartic graphs with order at most 8
• Perfect 3-colorings on 6-regular graphs of order 9
• Perfect 2-colorings of the Johnson graphs J(8,3) and J(8,4)
• Perfect 2-colorings of the generalized Petersen graph
• scientific article; zbMATH DE number 7009673 (Why is no real title available?)
• On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
• 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 7255560 (Why is no real title available?)
• 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 C_n C_m
• Perfect 2‐colorings of Hamming graphs
• On weight distributions of perfect colorings and completely regular codes
• 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
• Perfect 3-colorings of the line graphs of the connected bicubic graphs of order at most 12
• Perfect 2-colorings of the line graphs of the connected bicubic graphs of order at most 12
• Perfect 3-colorings of the Johnson graph \(J(6, 3)\)
• On the regularity of perfect 2-colorings of the Johnson graph

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)