15 citations · 18 across the 5 of their papers we have counts for
5 papers
On the anti-Kelulé problem of cubic graphs
Qiuli Li, Wai Chee Shiu, Pak Kiu Sun +1
An edge set of a connected graph is called an anti-Kekulé set if is connected and has no perfect matchings, where denotes the subgraph obtained by deleting all…
A characterization of L(2, 1)-labeling number for trees with maximum degree 3
Dong Chen, Wai Chee Shiu, Qiaojun Shu +2
An L(2, 1)-labeling of a graph is an assignment of nonnegative integers to the vertices of G such that adjacent vertices receive numbers differed by at least 2, and vertices at dis…
A relation between Clar covering polynomial and cube polynomial
Heping Zhang, Wai-Chee Shiu, Pak-Kiu Sun
The Clar covering polynomial (also called Zhang-Zhang polynomial in some chemical literature) of a hexagonal system is a counting polynomial for some types of resonant structures c…
Incidence coloring of Regular graphs and Complement graphs
Pak Kiu Sun
Using a relation between domination number and incidence chromatic number, we obtain necessary and sufficient conditions for -regular graphs to be -incidence colorable. A…
Some Results on incidence coloring, star arboricity and domination number
Pak Kiu Sun, Wai Chee Shiu
Two inequalities bridging the three isolated graph invariants, incidence chromatic number, star arboricity and domination number, were established. Consequently, we deduced an uppe…