5 papers · 1 filter
On generalized token graphs with tokens of different colors
Cristina Dalfó, Blas Fernández, Miquel Àngel Fiol +1
We generalize the concept of token graphs, and we call them supertoken graphs. In this work, we consider the variant in which tokens are distinguishable (for instance, by color) an…
On generalized -token graphs with distinguishable tokens and a maximum capacity of tokens per vertex
Yiting Cai, Cristina Dalfó, Blas Fernández +1
Supertoken graphs \(F^s_{k\times1}(G)\), also known as generalized token graphs, model configurations of \(k\) distinguishable tokens on a graph \(G\), with at most \(s\) tokens at…
On the -polynomial property of the full bipartite graph of a Hamming graph
Blas Fernández, Roghayeh Maleki, Štefko Miklavič +1
The -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 t…
Distance-regular graphs with classical parameters that support a uniform structure: case
Blas Fernández, Roghayeh Maleki, Štefko Miklavič +1
Let denote a finite, simple, connected, and undirected non-bipartite graph with vertex set and edge set . Fix a vertex , and define $\…
Characterizing bipartite distance-regularized graphs with vertices of eccentricity 4
Blas Fernández, Marija Maksimović, Sanja Rukavina
The characterization of bipartite distance-regularized graphs, where some vertices have eccentricity less than four, in terms of the incidence structures of which they are incidenc…