2 citations · 5 across the 19 of their papers we have counts for
7 papers · 1 filter
Set Representations of Linegraphs
Jun-Lin Guo, Tao-Ming Wang, Yue-Li Wang +1
Let be a graph with vertex set and edge set . A family of nonempty sets is a set representation of if there exists a one-to-…
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…
The Domination Number of Generalized Petersen Graphs with a Faulty Vertex
Jun-Lin Guo, Kuo-Hua Wu, Yue-Li Wang +1
In this paper, we investigate the domination number of generalized Petersen graphs P(n, 2) when there is a faulty vertex. Denote by the domination number of P(n,2) and…
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…