Omar Rosario Cayetano

Dr. Omar Rosario Cayetano

Universidad Autónoma de Guerrero (UAGro)
orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2016 in Discrete Mathematics
Verified
Journal Article
Closed access
SBSergio Bermudo
Sergio Bermudo
Jose M. RodriguezJose M. Rodriguez
Jose M. Rodriguez
OCOmar Rosario Cayetano
Omar Rosario Cayetano
JSJosé M. Sigarreta
José M. Sigarreta

6 May 2020 in Symmetry
Verified
Journal Article
Open access
PDF file
LBLudwin Ali Basilio
Ludwin Ali Basilio
JSJair Castro Simon
Jair Castro Simon
JLJesús Leaños
Jesús Leaños
OCOmar Rosario Cayetano
Omar Rosario Cayetano
If G = ( V ( G ) , E ( G ) ) is a simple connected graph with the vertex set V ( G ) and the edge set E ( G ) , S is a subset of V ( G ) , and let B ( S ) be the set of neighbors of S in V ( G ) ∖ S . Then, the differential of S ∂ ( S ) is defined as | B ( S ) | − | S | . The differential of G, denoted by ∂ ( G ) , is the maximum value of ∂ ( S ) for all subsets S ⊆ V ( G ) . The graph operator Q ( G ) is defined as the graph that results by subdividing every edge of G once and joining pairs of these new vertices iff their corresponding edges are incident in G. In this paper, we study the relations between ∂ ( G ) and ∂ ( Q ( G ) ) . Besides, we exhibit some results relating the differential ∂ ( G ) and well-known graph invariants, such as the domination number, the independence number, and the vertex-cover number.

13 March 2020 in Symmetry
Verified
Journal Article
Open access
PDF file
OCOmar Rosario Cayetano
Omar Rosario Cayetano
AIAlberto Fleitas Imbert
Alberto Fleitas Imbert
Gómez Aguilar José FranciscoGómez Aguilar José Francisco
Gómez Aguilar José Francisco
AGAntonio Fernando Sarmiento Galán
Antonio Fernando Sarmiento Galán
We use a conformable fractional derivative G T α through two kernels T ( t , α ) = e ( α − 1 ) t and T ( t , α ) = t 1 − α in order to model the alcohol concentration in blood; we also work with the conformable Gaussian differential equation (CGDE) of this model, to evaluate how the curve associated with such a system adjusts to the data corresponding to the blood alcohol concentration. As a practical application, using the symmetry of the solution associated with the CGDE, we show the advantage of our conformable approaches with respect to the usual ordinary derivative.

1 November 2024 in RAIRO - Operations Research
Verified
Journal Article
Open access
PDF file
LBLudwin Ali Hernández Basilio
Ludwin Ali Hernández Basilio
JMJesús Leaños Macías
Jesús Leaños Macías
OCOmar Rosario Cayetano
Omar Rosario Cayetano
JAJosé María Sigarreta Almira
José María Sigarreta Almira
Let G = (V (G), E(G)) be a simple graph with vertex set V (G) and edge set E(G). Let S be a subset of V (G), and let B(S) be the set of neighbours of S in V (G)∖S. The differential ∂(S) of S is the number |B(S)|−|S|. The maximum value of ∂(S) taken over all subsets S ⊆ V (G) is the differential ∂(G) of G. The graph R(G) is defined as the graph obtained from G by adding a new vertex ve for each e ∈ E(G), and by joining ve to the end vertices of e. In this paper we study the relationship between ∂(G) and ∂(R(G)), and give tight asymptotic bounds for ∂(R(G)). We also exhibit some relationships between certain vertex sets of G and R(G) which involve well known graph theoretical parameters.

11 December 2020 in Symmetry
Verified
Journal Article
Open access
PDF file
JHJuan Carlos Hernández-Gómez
Juan Carlos Hernández-Gómez
GHGerardo Hernández
Gerardo Hernández
JRJesús Romero-Valencia
Jesús Romero-Valencia
OCOmar Rosario Cayetano
Omar Rosario Cayetano
Transitivity on graphs is a concept widely investigated. This suggest to analyze the action of automorphisms on other sets. In this paper, we study the action on the family of γ-sets (minimum dominating sets), the graph is called γ-transitive if given two γ-sets there exists an automorphism which maps one onto the other. We deal with two families: paths Pn and cycles Cn. Their γ-sets are fully characterized and the action of the automorphism group on the family of γ-sets is fully analyzed.

19 January 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
RMRaul Juárez Morales
Raul Juárez Morales
GHGerardo Reyna Hernández
Gerardo Reyna Hernández
OCOmar Rosario Cayetano
Omar Rosario Cayetano
JRJesús Romero-Valencia
Jesús Romero-Valencia
Let Γ(V,E) be a simple connected graph with more than one vertex, without loops or multiple edges. A nonempty subset S⊆V is a global offensive alliance if every vertex v∈V−S satisfies that δS(v)≥δS¯(v)+1. The global offensive alliance numberγo(Γ) is defined as the minimum cardinality among all global offensive alliances. Let R be a finite commutative ring with identity. In this paper, we study the global offensive alliance number of the zero-divisor graph Γ(R).