A. Trujillo-Negrete

activity

20172026

most citedOn the Connectivity of Token Graphs of Trees

9 citations · 20 across the 11 of their papers we have counts for

collaborators

13 papers

math.CO2026

Automorphisms of Token Graphs That Send $4$ -Cycles Generated by Two Edges to Cycles Generated by a $4$ -Cycle and Two Tokens

Ruy Fabila-Monroy, Sergio Gerardo Gómez-Galicia, Ana Laura Trujillo-Negrete

Let $G$ be a connected graph. The $k$ -token graph of $G$ is the graph $F_{k} (G)$ whose vertex set consists of all subsets of $k$ vertices of $G$ , where two of them are adjacent whene…

math.CO2024

A study on token digraphs

Cristina G. Fernandes, Carla N. Lintzmayer, Juan P. Peña +3

For a digraph $D$ of order $n$ and an integer $1 \leq k \leq n - 1$ , the $k$ -token digraph of $D$ is the graph whose vertices are all $k$ -subsets of vertices of $D$ and, given two su…

math.CO2024

On the Automorphisms of Token Graphs Generated by $2$ -cuts with the Same Neighbours

Ruy Fabila-Monroy, Sergio Gerardo Gómez-Galicia, Daniel Gregorio-Longino +2

Let $G$ be a connected graph on $n$ vertices and $1 \leq k \leq n - 1$ an integer. The $k$ -token graph of $G$ is the graph $F_{k} (G)$ whose vertices are all the $k$ -subsets of vertices o…

math.CO2024

On the Treewidth of Token and Johnson Graphs

Ruy Fabila-Monroy, Sergio Gerardo Gómez-Galicia, César Hernández-Cruz +1

Let $G$ be a graph on $n$ vertices and $1 \leq k \leq n$ a fixed integer. The \textit{ $k$ -token graph} of $G$ is the graph $F_{k} (G)$ whose vertex set consists of all $k$ -subsets of th…

math.CO2023

On the Automorphism Group of Token Graphs of Complete Bipartite Graphs

Ruy Fabila-Monroy, Ana Laura Trujillo-Negrete

Let $G$ be a graph of order $n$ and let $k \in {1, 2, \dots, n - 1}$ . The $k$ -token graph of $G$ is the graph, whose vertices are all the $k$ -subsets of vertices of $G$ , where two suc…

math.CO2022★ 1 cited

Connected ( $C_{4}$ ,Diamond)-free Graphs Are Uniquely Reconstructible from Their Token Graphs

Ruy Fabila-Monroy, Ana Laura Trujillo-Negrete

A diamond is the graph that is obtained from removing an edge from the complete graph on $4$ vertices. A ( $C_{4}$ ,diamond)-free graph is a graph that does not contain a diamond or a…

math.CO2021

Hamiltonicity of the Complete Double Vertex Graph of some Join Graphs

Luis Manuel Rivera, Ana Laura Trujillo-Negrete

The complete double vertex graph $M_{2} (G)$ of $G$ is defined as the graph whose vertices are the $2$ -multisubsets of $V (G)$ , and two of such vertices are adjacent in $M_{2} (G)$ if the…

math.CO2021★ 7 cited

Hamiltonicity of Token Graphs of some Join Graphs

Luis Enrique Adame, Luis Manuel Rivera, Ana Laura Trujillo-Negrete

Let $G$ be a simple graph of order $n$ and let $k$ be an integer such that $1 \leq k \leq n - 1$ . The $k$ -token graph $G^{{k}}$ of $G$ is the graph whose vertices are the $k$ -subsets…

math.CO2020★ 1 cited

On the Laplacian spectra of token graphs

C. Dalfó, F. Duque, R. Fabila-Monroy +4

We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The $k$ -token graph $F_{k} (G)$ of a graph $G$ is the graph whose vertices are the $k$ -subsets…

cs.CG2020

Empty Rainbow Triangles in $k$ -colored Point Sets

Ruy Fabila-Monroy, Daniel Perz, Ana Laura Trujillo-Negrete

Let $S$ be a set of $n$ points in general position in the plane. Suppose that each point of $S$ has been assigned one of $k \geq 3$ possible colors and that there is the same number…

math.CO2020★ 2 cited

Hamiltonicity of the Double Vertex Graph and the Complete Double Vertex Graph of some Join Graphs

Luis Enrique Adame, Luis Manuel Rivera, Ana Laura Trujillo-Negrete

Let $G$ be a simple graph of order $n$ . The double vertex graph $F_{2} (G)$ of $G$ is the graph whose vertices are the $2$ -subsets of $V (G)$ , where two vertices are adjacent in $F_2(G…

math.CO2020★ 9 cited

On the Connectivity of Token Graphs of Trees

Ruy Fabila-Monroy, Jesús Leaños, Ana Laura Trujillo-Negrete

Let $k$ and $n$ be integers such that $1 \leq k \leq n - 1$ , and let $G$ be a simple graph of order $n$ . The $k$ -token graph $F_{k} (G)$ of $G$ is the graph whose vertices are the $k$ -su…

math.CO2017

Hamiltonicity of token graphs of fan graphs

Luis Manuel Rivera, Ana Laura Trujillo-Negrete

In this note we show that the token graphs of fan graphs are Hamiltonian. This result provides another proof of the Hamiltonicity of Johnson graphs and also extends previous result…

Automorphisms of Token Graphs That Send 4-Cycles Generated by Two Edges to Cycles Generated by a 4-Cycle and Two Tokens

A study on token digraphs

On the Automorphisms of Token Graphs Generated by 2-cuts with the Same Neighbours

On the Treewidth of Token and Johnson Graphs

On the Automorphism Group of Token Graphs of Complete Bipartite Graphs

Connected (C4​,Diamond)-free Graphs Are Uniquely Reconstructible from Their Token Graphs

Hamiltonicity of the Complete Double Vertex Graph of some Join Graphs

Hamiltonicity of Token Graphs of some Join Graphs

On the Laplacian spectra of token graphs

Empty Rainbow Triangles in k-colored Point Sets

Hamiltonicity of the Double Vertex Graph and the Complete Double Vertex Graph of some Join Graphs

On the Connectivity of Token Graphs of Trees

Hamiltonicity of token graphs of fan graphs

Automorphisms of Token Graphs That Send $4$ -Cycles Generated by Two Edges to Cycles Generated by a $4$ -Cycle and Two Tokens

On the Automorphisms of Token Graphs Generated by $2$ -cuts with the Same Neighbours

Connected ( $C_{4}$ ,Diamond)-free Graphs Are Uniquely Reconstructible from Their Token Graphs

Empty Rainbow Triangles in $k$ -colored Point Sets