Geodesic
On the \(Q\)-polynomial property of the full bipartite graph of a Hamming graph
The electronic journal of combinatorics, Tome 31 (2024) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The $Q$-polynomial property is an algebraic property of distance-regular graphs, that was introduced by Delsarte in his study of coding theory. Many distance-regular graphs admit the $Q$-polynomial property. Only recently the $Q$-polynomial property has been generalized to graphs that are not necessarily distance-regular. In [J. Combin. Theory Series. A, 205:105872, 2024] it was shown that the graphs arising from the Hasse diagrams of the so-called attenuated space posets are $Q$-polynomial. These posets could be viewed as $q$-analogs of the Hamming posets, which were not studied in that paper. The main goal of this article is to fill this gap by showing that the graphs arising from the Hasse diagrams of the Hamming posets are $Q$-polynomial.
DOI : 10.37236/12898
Classification : 05E30, 05C50, 05C12, 94B05, 06A07
Mots-clés : distance-regular graphs, attenuated space posets 
@article{10_37236_12898,
     author = {Blas Fern\'andez and Roghayeh  Maleki and \v{S}tefko  Miklavi\v{c} and Giusy  Monzillo},
     title = {On the {\(Q\)-polynomial} property of the full bipartite graph of a {Hamming} graph},
     journal = {The electronic journal of combinatorics},
     year = {2024},
     volume = {31},
     number = {4},
     doi = {10.37236/12898},
     zbl = {1551.05421},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/12898/}
}
TY  - JOUR
AU  - Blas Fernández
AU  - Roghayeh  Maleki
AU  - Štefko  Miklavič
AU  - Giusy  Monzillo
TI  - On the \(Q\)-polynomial property of the full bipartite graph of a Hamming graph
JO  - The electronic journal of combinatorics
PY  - 2024
VL  - 31
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/12898/
DO  - 10.37236/12898
ID  - 10_37236_12898
ER  - 
%0 Journal Article
%A Blas Fernández
%A Roghayeh  Maleki
%A Štefko  Miklavič
%A Giusy  Monzillo
%T On the \(Q\)-polynomial property of the full bipartite graph of a Hamming graph
%J The electronic journal of combinatorics
%D 2024
%V 31
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/12898/
%R 10.37236/12898
%F 10_37236_12898
Blas Fernández; Roghayeh  Maleki; Štefko  Miklavič; Giusy  Monzillo. On the \(Q\)-polynomial property of the full bipartite graph of a Hamming graph. The electronic journal of combinatorics, Tome 31 (2024) no. 4. doi: 10.37236/12898

Cité par Sources :