L. N. Grippo

activity

20142026

most citedDomination parameters with number 2: interrelations and algorithmic consequences

28 citations · 52 across the 20 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Perfect Edge Domination in $P_{6}$ -free Graphs and in Graphs Without Efficient Edge Dominating Sets

Luciano N. Grippo, Min Chih Lin, Camilo Vera

An edge of a graph dominates itself along with any edge that shares an endpoint with it. An efficient edge dominating set (also called a dominating induced matching, DIM) is a subs…

math.CO2025

Formulas and Upper Bounds for the Carath{é}odory Number of Hamming Graphs

Ezequiel Dratman, Lucía M. González, Luciano N. Grippo

Let $G$ be a simple graph and let $S$ be a subset of its vertices. We say that $S$ is $P_{3}$ -convex if every vertex $v \in V (G)$ that has at least two neighbors in $S$ also belongs…

Perfect Edge Domination in P6​-free Graphs and in Graphs Without Efficient Edge Dominating Sets

Formulas and Upper Bounds for the Carath{é}odory Number of Hamming Graphs

Perfect Edge Domination in $P_{6}$ -free Graphs and in Graphs Without Efficient Edge Dominating Sets