8 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Christian Rubio-Montiel2 profiles10 · h 7
- G. Araujo-Pardo4 · h 11
- Adrián Vázquez-Ávila2 profiles2 · h 4
- A. Erdely2 · h 8
- Andrea B. Ramos-Tort2 profiles2 · h 1
- D. Lara2 · h 5
- G. Valencia-Ortega2 · h 7
- Aar'on Atilano1 · h 0
- A. Vázquez-Ávila1 · h 3
- C. A. Montufar1 · h 3
- Christian Rubio Montiel1 · h 3
- C. Huemer1 · h 17
- Universidad Nacional Autónoma de MéxicoMX14 papers
- Centro de Investigación y de Estudios Avanzados del Instituto Politécnico NacionalMX3 papers
- Instituto Politécnico NacionalMX3 papers
- Laboratoire franco-mexicain d'informatique et d'automatiqueMX2 papers
- Bank of MexicoMX1 paper
- Comenius University BratislavaSK1 paper
- Eötvös Loránd UniversityHU1 paper
- National Institute of Astrophysics, Optics and ElectronicsMX1 paper
- Universidad Aeronáutica en QuerétaroMX1 paper
- Universidad Autónoma del Estado de MéxicoMX1 paper
- Universidad Autónoma MetropolitanaMX1 paper
- Universitat Politècnica de CatalunyaES1 paper
16 papers
Carnot, Stirling, Ericsson stochastic heat engines: Efficiency at maximum power
O. Contreras-Vergara, N. Sánchez-Salas, G. Valencia-Ortega +1
This work obtains the efficiency at maximum power for a stochastic heat engine performing Carnot-like, Stirling-like and Ericsson-like cycles. For the mesoscopic engine a Brownian…
On the harmonious chromatic number of graphs
Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen +1
The harmonious chromatic number of a graph is the minimum number of colors that can be assigned to the vertices of in a proper way such that any two distinct edges have dif…
Energy conversion theorems for some linear steady-states
L. A. Arias-Hernandez, G. Valencia-Ortega, F. Angulo-Brown +1
One of the main issues that real energy converters present, when they produce effective work, is the inevitable entropy production. Within the context of Non-equilibrium Thermodyna…
Motions of a connected subgraph representing a swarm of robots inside a graph of work stations
Aarón Atilano, Sebastian Bejos, Christian Rubio-Montiel
Imagine that a swarm of robots is given, these robots must communicate with each other, and they can do so if certain conditions are met. We say that the swarm is connected if ther…
Achromatic numbers of Kneser graphs
Gabriela Araujo-Pardo, Juan Carlos Díaz-Patiño, Christian Rubio-Montiel
Complete colorings have the property that any two color classes has at least an edge between them. Parameters such as the Grundy, achromatic and pseudoachromatic numbers comes from…
Extremal regular graphs of given chromatic number
Christian Rubio-Montiel
We define an extremal -graph as an -regular graph with chromatic number of minimum order. We show that the Tur{\' a}n graphs , the antihole graphs and the g…
On crossing families of complete geometric graphs
Dolores Lara, Christian Rubio-Montiel
A crossing family is a collection of pairwise crossing segments, this concept was introduced by Aronov et. al. (1994). They prove that any set of points (in general position) i…
Higgs decay mediated by top-quark with flavor-changing neutral scalar interactions
J. A. Orduz-Ducuara
We explore the flavor-changing parameters mediated by a Higgs boson within the THDM-III context. In particular, the processes, and check the high suppression for the F…
The 6-girth-thickness of the complete graph
Héctor Castañeda-López, Pablo C. Palomino, Andrea B. Ramos-Tort +2
The -girth-thickness of a graph is the minimum number of planar subgraphs of girth at least whose union is . In this paper, we determine the -girth-thickn…
Covering and 2-degree-packing numbers in graphs
Carlos Alfaro Montufar, Christian Rubio Montiel, Adrián Vázquez-Ávila
In this paper, we give a relationship between the covering number of a simple graph , , and a new parameter associated to which is called 2-degree-packing number of $G…
Complete colorings of planar graphs
M. Gabriela Araujo-Pardo, F. Esteban Contreras-Mendoza, Sara J. Murillo-García +2
In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs embedded on a surface. We gi…
On line colorings of finite projective spaces
Gabriela Araujo-Pardo, György Kiss, Christian Rubio-Montiel +1
In this paper, we prove lower and upper bounds on the achromatic and the pseudoachromatic indices of the -dimensional finite projective space of order .
Coloring decompositions of complete geometric graphs
Clemens Huemer, Dolores Lara, Christian Rubio-Montiel
A decomposition of a non-empty simple graph is a pair , such that is a set of non-empty induced subgraphs of , and every edge of belongs to exactly one subgra…
A note on linear B-spline copulas
Arturo Erdely
In this brief note we prove that linear B-spline copulas is not a new family of copulas since they are equivalent to checkerboard copulas, and discuss in particular how they are us…
Backtesting forecast accuracy
Arturo Erdely
A statistical test based on the geometric mean is proposed to determine if a predictive model should be rejected or not, when the quantity of interest is a strictly positive contin…
On the pseudoachromatic index of the complete graph III
G. Araujo-Pardo, J. J. Montellano-Ballesteros, C. Rubio-Montiel +1
Let be the projective plane of order , let the pseudoachromatic number of the complete line graph of order , let $ a\in \{ 3,4,\dots,\tfrac{q}{2…