Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs (Q2202769): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s0037446620050109 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3090986818 / rank | |||
Normal rank | |||
Latest revision as of 09:29, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs |
scientific article |
Statements
Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs (English)
0 references
30 September 2020
0 references
perfect coloring
0 references
transversals of hypergraph
0 references
combinatorial designs
0 references
\(q\)-analogs of combinatorial designs
0 references
difference sets
0 references
bent functions
0 references
Johnson graph
0 references
Grassmann graph
0 references
Delsarte-Hoffman bound
0 references
