AI Chat AI Image Generator AI Video Text to Speech

On the coset graph construction of distance-regular graphs

05/31/2022

∙

by Minjia Shi, et al.

∙

∙

We show that no more new distance-regular graphs in the tables of the book of (Brouwer, Cohen, Neumaier, 1989) can be produced by using the coset graph of additive completely regular codes over finite fields.

Minjia Shi
50 publications
Denis S. Krotov
23 publications
Patrick Solé
29 publications

page 1

page 2

page 3

page 4

research

∙ 06/19/2018

A new distance-regular graph of diameter 3 on 1024 vertices

The dodecacode is a nonlinear additive quaternary code of length 12. By ...

0 Minjia Shi, et al. ∙

research

∙ 08/20/2020

On Fine-Grained Exact Computation in Regular Graphs

We show that there is no subexponential time algorithm for computing the...

0 Saeed Akhoondian Amiri, et al. ∙

research

∙ 09/28/2018

Expander Graphs are Non-Malleable Codes

Any d-regular graph on n nodes with spectral expansion λ satisfying n = ...

0 Peter M. R. Rasmussen, et al. ∙

research

∙ 08/30/2019

Existence of d-regular nut graphs for d at most 11

A nut graph is a singular graph with one-dimensional kernel and correspo...

0 Patrick W. Fowler, et al. ∙

research

∙ 08/30/2019

Existence of regular nut graphs for degree at most 11

A nut graph is a singular graph with one-dimensional kernel and correspo...

0 Patrick W. Fowler, et al. ∙

research

∙ 08/26/2019

Breadth-first search on a Ramanujan graph

The behavior of the randomized breadth-first search algorithm is analyze...

0 Janko Boehm, et al. ∙

research

∙ 12/25/2022

A general construction of regular complete permutation polynomials

Let r≥ 3 be a positive integer and 𝔽_q the finite field with q elements....

0 Wei Lu, et al. ∙