Universidad Autónoma de Zacatecas "Francisco García Salinas"

output

19932026

most citedBounds on the basic physical parameters for anisotropic compact general relativistic objects

377 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

15 papers · 1 filter

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 connectivity of the disjointness graph of segments of point sets in general position in the plane

J. Leaños, Christophe Ndjatchi, L. M. Ríos-Castro

Let $P$ be a set of $n \geq 3$ points in general position in the plane. The edge disjointness graph $D (P)$ of $P$ is the graph whose vertices are all the closed straight line segmen…

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.CO2019★ 1 cited

The Edge-connectivity of Token Graphs

J. Leaños, M. K. Christophe Ndjatchi

Let $G$ be a simple graph of order $n \geq 2$ and let $k \in {1, \dots, n - 1}$ . The $k$ -token graph $F_{k} (G)$ of $G$ is the graph whose vertices are the $k$ -subsets of $V (G)$ , where…

math.CO2019★ 6 cited

The automorphism groups of some token graphs

Sofía Ibarra, Luis Manuel Rivera

In this paper we obtain the automorphism groups of the token graphs of some graphs. In particular we obtain the automorphism group of the $k$ -token graph of the path graph $P_{n}$ , f…

math.CO2018★ 4 cited

Independence numbers of some double vertex graphs and pair graphs

Paloma Jiménez-Sepúlveda, Luis Manuel Rivera

The combinatorial properties of double vertex graphs has been widely studied since the 90's. However only very few results are know about the independence number of such graphs. In…

math.CO2017★ 2 cited

The Chromatic Number of the Disjointness Graph of the Double Chain

Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Jesús Leaños +1

Let $P$ be a set of $n \geq 4$ points in general position in the plane. Consider all the closed straight line segments with both endpoints in $P$ . Suppose that these segments are co…

math.CO2017

Minimal obstructions to $2$ -polar cographs

Pavol Hell, César Hernández-Cruz, Cláudia Linhares Sales

A graph is a cograph if it is $P_{4}$ -free. A $k$ -polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by…

math.CO2015★ 32 cited

Regularity and Planarity of Token Graphs

Walter Carballosa, Ruy Fabila-Monroy, Jesús Leaños +1

Let $G = (V, E)$ be a graph of order $n$ and let $1 \leq k < n$ be an integer. The $k$ -token graph of $G$ is the graph whose vertices are all the $k$ -subsets of $V$ , two of which are ad…

math.CO2014

Hyperbolicity in the corona and join of graphs

Walter Carballosa, José M. Rodríguez, José M. Sigarreta

If X is a geodesic metric space and $x_{1}, x_{2}, x_{3} \in X$ , a {\it geodesic triangle} $T = {x_{1}, x_{2}, x_{3}}$ is the union of the three geodesics $[x_{1} x_{2}]$ , $[x_{2} x_{3}]$ and $[x_{3} x_{1}]$ in $…

math.CO2014★ 4 cited

On the pseudolinear crossing number

Cesar Hernandez-Velez, Jesus Leanos, Gelasio Salazar

A drawing of a graph is {\em pseudolinear} if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The {\em pseudolinear crossing n…

math.CO2013★ 6 cited

Blocks in cycles and k-commuting permutations

Rutilo Moreno, Luis Manuel Rivera

Let $k$ be a nonnegative integer, and let $α$ and $β$ be two permutations of $n$ symbols. We say that $α$ and $β$ $k$ -commute if $H (α β, β α) = k$ , where $H$ denotes the Hamming metric…

math.CO2012

On the decay of crossing numbers of sparse graphs

Jozsef Balogh, Jesus Leanos, Gelasio Salazar

Richter and Thomassen proved that every graph has an edge $e$ such that the crossing number $\ucr(G-e)$ of $G - e$ is at least $(2/5)\ucr(G) - O(1)$. Fox and Cs. Tóth proved that den…

math.CO2010★ 12 cited

Point sets that minimize $(\leq k)$ -edges, 3-decomposable drawings, and the rectilinear crossing number of $K_{30}$

M. Cetina, C. Hernández-Vélez, J. Leaños +1

There are two properties shared by all known crossing-minimizing geometric drawings of $K_{n}$ , for $n$ a multiple of 3. First, the underlying $n$ -point set of these drawings has exa…

math.CO2010★ 2 cited

On the number of mth roots of permutations

Jesús Leaños, Rutilo Moreno, Luis Manuel Rivera-Martínez

Let m be a fixed positive integer. It is well-known that a permutation $σ$ may have one, many, or no mth roots. In this note we provide an explicit expression and a generating func…