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.CO2026
Counting -convex sets in graphs
Mitre C. Dourado, Luciano N. Grippo, Min Chih Lin +1
We study the -convexity, the path convexity generated by all three-vertex paths, and focus on the problem of counting the -convex vertex sets of a graph , denoted by $…