33 citations · 47 across the 6 of their papers we have counts for
6 papers
Reducing Dominating Sets in Graphs
Ernesto Parra Inza, José María Sigarreta Almira, Nodari Vakhania
A dominating set of a graph is a subset of vertices such that every vertex has at least one neighbor in set . The corresponding opti…
Algorithms for the Global Domination Problem
Ernesto Parra Inza, Nodari Vakhania, Jose M. Sigarreta Almira +1
A dominating set D in a graph G is a subset of its vertices such that every vertex of the graph which does not belong to set D is adjacent to at least one vertex from set D. A set…
Exact and Heuristic Algorithms for the Domination Problem
Ernesto Parra Inza, Frank Angel Hernández Mira, José María Sigarreta Almira +1
In a simple connected graph , a subset of vertices is a dominating set if any vertex is adjacent to some vertex from this subset.…
Jensen-type inequalities for convex and -convex functions via fractional calculus
Yamilet Quintana, José M. Rodríguez, José M. Sigarreta Almira
Inequalities play an important role in pure and applied mathematics. In particular, Jensen's inequality, one of the most famous inequalities, plays a main role in the study of the…
A note on total co-independent domination in trees
Abel Cabrera Martínez, Frank A. Hernández Mira, José M. Sigarreta Almira +1
A set of vertices of a graph is a total dominating set if every vertex of is adjacent to at least one vertex of . The total domination number of is the minimum c…
Defensive k-alliances in graphs
J. A. Rodriguez-Velazquez, I. G. Yero, J. M. Sigarreta
Let be a simple graph. For a nonempty set , and a vertex , denotes the number of neighbors has in . A nonempty set …