Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Simoens, Robin"'
A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospectral graphs with cospectral complements can be constructed using regul
Externí odkaz:
http://arxiv.org/abs/2410.07948
We characterise the minimum weight codewords of the $p$-ary linear code of intersecting lines in ${\rm PG}(3,q)$, $q=p^h$, $q\geq19$, $p$ prime, $h\geq 1$. If $q$ is even, the minimum weight equals $q^3+q^2+q+1$. If $q$ is odd, the minimum weight equ
Externí odkaz:
http://arxiv.org/abs/2403.07451
We prove that the natural isomorphism between GF(2^h) and GF(2)^h induces a bijection between stabiliser codes on n quqits with local dimension q=2^h and binary stabiliser codes on hn qubits. This allows us to describe these codes geometrically: a st
Externí odkaz:
http://arxiv.org/abs/2401.06618
We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniquely determined by their spectrum. We do so by constructing graphs that are cospectral but non-isomorphic to these graphs.
Externí odkaz:
http://arxiv.org/abs/2305.16858
We determine the diameter of generalized Grassmann graphs and the zero forcing number of some generalized Johnson graphs, generalized Grassmann graphs and the Hamming graphs. Our work extends several previously known results.
Externí odkaz:
http://arxiv.org/abs/2302.07757
Publikováno v:
In Discrete Applied Mathematics 15 May 2024 348:221-230
