For a graph $G=(V,E)$ of order $n$ and an integer $k$ between $1$ and $\lfloor\frac{n}{2}\rfloor$, its token graph $F_k(G)$ is the graph whose vertices consist of the $\binom{n}{k}$ $k$-subsets of $V$, and two vertices of $F_k(G)$ are adjacent whenever their symmetric difference is an edge in $E$. It was found that the...
Xiao-Di Song, C. Dalf'o, M. Fiol et al.· 0 citations
We introduce and study a new family of circulant digraphs associated with the cyclic group \({\mathbb Z}_N\), obtained by restricting admissible combinations of two generators \(a\) and \(b\) to three coordinate sectors. The resulting distance-like function differs from the standard directed distance in circulant digra...
C. Dalf'o, M. Fiol, M. Reyes· Utilitas mathematica· 0 citations
In this paper, we study proper and complete edge-colorings of Johnson graphs $J(n,2)$, also called $n$-triangular graphs. They are isomorphic both to the 2-token graphs of complete graphs and to the line graphs of complete graphs. A $t$-edge-coloring of a graph $G$ is a function that assigns one color from $\{1,2,\ldot...
G. Araujo-Pardo, C. Dalf'o, M. Reyes· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
