28 citations · 52 across the 20 of their papers we have counts for
3 papers · 1 filter
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…
A Sharp Forbidden Interval for the Nontrivial Adjacency Eigenvalues of Trivially Perfect Graphs
Cristian M. Conde, Ezequiel Dratman, Luciano N. Grippo
We prove a sharp forbidden interval for the nontrivial adjacency eigenvalues of trivially perfect graphs. More precisely, we show that if is a trivially perfect graph, then $\o…
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 $…