Universidad Autónoma de Guerrero

output

20062025

most citedTopological versus spectral properties of random geometric graphs

23 citations

researchers with a paper here

collaborating institutions

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2024★ 2 cited

Reducing Dominating Sets in Graphs

Ernesto Parra Inza, José María Sigarreta Almira, Nodari Vakhania

A dominating set of a graph $G = (V, E)$ is a subset of vertices $S \subseteq V$ such that every vertex $v \in V ∖ S$ has at least one neighbor in set $S$ . The corresponding opti…

cs.DM2023★ 3 cited

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…

cs.DM2022★ 5 cited

A polynomial-time approximation to a minimum dominating set in a graph

Frank Hernandez, Ernesto Parra, Jose Maria Sigarreta +1

A {\em dominating set} of a graph $G = (V, E)$ is a subset of vertices $S \subseteq V$ such that every vertex $v \in V ∖ S$ has at least one neighbor in $S$ . Finding a dominating…