On Perfect 2‐Colorings of Johnson Graphs <i>J</i>(<i>v</i>, 3) (Q4929281): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jcd.21327 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1954638097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced perfect colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of 2-designs Slambda(2,3,v) without repeated blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3544770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Single Error-Correcting Codes in the Johnson Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely regular designs of strength one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely regular designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle-balance conditions for distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regularity of perfect 2-colorings of the Johnson graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely regular codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nonexistence of Perfect Codes over Finite Fields / rank
 
Normal rank

Latest revision as of 13:24, 6 July 2024

scientific article; zbMATH DE number 6175540
Language Label Description Also known as
English
On Perfect 2‐Colorings of Johnson Graphs <i>J</i>(<i>v</i>, 3)
scientific article; zbMATH DE number 6175540

    Statements

    On Perfect 2‐Colorings of Johnson Graphs <i>J</i>(<i>v</i>, 3) (English)
    0 references
    13 June 2013
    0 references
    equitable partition
    0 references
    perfect coloring
    0 references
    completely regular code
    0 references
    Johnson graph
    0 references
    distance-regular graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references