Showing math.COShow all
2 papers · 1 filter
math.CO2026
Counting perfect edge dominating sets: extremal results and linear-time algorithms
Luciano N. Grippo, Min Chih Lin, Verónica Moyano +1
An edge of a graph \emph{dominates} itself and each edge adjacent to it. A \emph{perfect edge dominating set} is a subset of edges such that each edge outside the subset is dominat…
math.CO2022
On the rank of the distance matrix of graphs
Ezequiel Dratman, Luciano N. Grippo, Verónica Moyano +1
Let be a connected graph with . The -entry of the distance matrix of is the distance between and . In this article, using…