4 papers
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…
The interplay between network transitivity and community structure
Mingao Yuan, Irin Rahman, Chengay S Wangchuk +1
Recent empirical observations suggest that network transitivity is highly correlated with community structure in many real-world networks. In this paper, we theoretically investiga…
Removing bottlenecks in the recognition of small -graph classes
Flavia Bonomo-Braberman, Min Chih Lin, Ignacio Maqueda
A graph is a -graph if its vertex set can be partitioned into independent sets and cliques. This family simultaneously generalizes split, bipartite, and co-bip…
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 $…