2 citations · 5 across the 19 of their papers we have counts for
19 papers
On the Orbits of Crossed Cubes
Tzong-Huei Shiau, Yue-Li Wang, Kung-Jui Pai
An orbit of is a subset of such that for any two vertices , where is an isomorphism of . The orbit number of a graph , denoted by $\text…
P_3-Games on Chordal Bipartite Graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +3
Let G=(V,E) be a connected graph. A set U subseteq V is convex if G[U] is connected and all vertices of V\U have at most one neighbor in U. Let sigma(W) denote the unique smallest…
Convexities in Some Special Graph Classes ---New Results in AT-free Graphs and Beyond
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu +2
We study convexity properties of graphs. In this paper we present a linear-time algorithm for the geodetic number in tree-cographs. Settling a 10-year-old conjecture, we prove that…
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…