5 citations · 18 across the 34 of their papers we have counts for
5 papers · 2 filters
On Complexities of Minus Domination
Luérbio Faria, Wing-Kai Hon, Ton Kloks +3
A function f: V \rightarrow \{-1,0,1\} is a minus-domination function of a graph G=(V,E) if the values over the vertices in each closed neighborhood sum to a positive number. The w…
Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu +2
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical inde…
Independent set in categorical products of cographs and splitgraphs
W. Hon, T. Kloks, S. Liu +2
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. We show that the ultimate cat…
On independence domination
Wing-Kai Hon, Ton Kloks, Hsiang Hsuan Liu +2
Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we invest…
On retracts, absolute retracts, and folds in cographs
Ton Kloks, Yue-Li Wang
Let G and H be two cographs. We show that the problem to determine whether H is a retract of G is NP-complete. We show that this problem is fixed-parameter tractable when parameter…