- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Harris Kwong, Sin-Min Lee
- 2008

Let G = (V, E) be a graph with a vertex labeling f : V --> £2 that induces an edge labeling r : E --> defined by r(xy) f(x) + fey)· For each i E £2, let Vf(i) card{v E V : f(v) i} and ef(i) = card{e… (More)

- Harris Kwong, Sin-Min Lee
- 2000

Let G be a graph with vertex set V and edge set E. Any vertex labeling f : V ! f0;1g induces a partial edge labeling f ⁄ : E ! f0;1g deflned by f ⁄ (xy) = f(x) if and only if f(x) = f(y). Let vf(i) =… (More)

- Wai Chee Shiu, Harris Kwong
- Discrete Mathematics
- 2008

Let G=(V,E) be a graph, a vertex labeling f:V->Z"2 induces an edge labeling f^*:E->Z"2 defined by f^*(xy)=f(x)+f(y) for each [email protected]?E. For each [email protected]?Z"2, define… (More)

- Harris Kwong
- Applied Mathematics and Computation
- 2007

In this short note, we study two families of determinants the entries of which are linear functions of Fibonacci or Lucas numbers. The results are rather simple, and the two determinants only differ… (More)

- Harris Kwong, Sin-Min Lee, Ho Kuen Ng
- Discrete Mathematics
- 2008

Let G be a graph with vertex set V and edge set E, and let A be an abelian group. A labeling f:V->A induces an edge labeling f^*:E->A defined by f^*(xy)=f(x)+f(y). For [email protected]?A, let… (More)

- Olga Bodroza-Pantic, Harris Kwong, Milan Pantic
- Discrete Applied Mathematics
- 2016

Abstract In the studies that have been devoted to the protein folding problem, which is one of the great unsolved problems of science, some specific graphs, like the so-called triangular grid graphs,… (More)

- Olga Bodroza-Pantic, Harris Kwong, Milan Pantic
- Discrete Mathematics & Theoretical Computer…
- 2015

We study the enumeration of Hamiltonian cycles on the thin grid cylinder graph $C_m \times P_{n+1}$. We distinguish two types of Hamiltonian cycles, and denote their numbers $h_m^A(n)$ and… (More)

- Harris Kwong
- Ars Comb.
- 2009

Any vertex labeling f : V → {0, 1} of the graph G = (V, E) induces a partial edge labeling f∗ : E → {0, 1} defined by f∗(uv) = f(u) if and only if f(u) = f(v). The balance index set of G is defined… (More)

- Wai Chee Shiu, Harris Kwong
- Australasian J. Combinatorics
- 2009

Any vertex labeling f : V → {0, 1} of the graph G = (V,E) induces a partial edge labeling f ∗ : E → {0, 1} defined by f ∗(uv) = f(u) if and only if f(u) = f(v). The balance index set of G is defined… (More)