activity
20112015
most citedOn the number of unlabeled vertices in edge-friendly labelings of graphs

2 citations · 4 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2015

On the Edge-Balanced Index Sets of Complete Even Bipartite Graphs

Ha Dao, Hung Hua, Michael Ngo +1

In 2009, Kong, Wang, and Lee introduced the problem of finding the edge-balanced index sets () of complete bipartite graphs , where they examined the cases , …

math.CO2014

A counterexample to a conjecture of Ghosh

Hung Hua, Elliot Krop, Christopher Raridan

We answer two questions of Shamik Ghosh in the negative. We show that there exists a lobster tree of diameter less than 6 which accepts no alpha-labeling with two central vertices…

math.CO2014★ 1 cited

On the Edge-Balanced Index Sets of Odd/Even Complete Bipartite Graphs

Hung Hua, Christopher Raridan

In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets of complete bipartite graphs by solving the cases where , , , $4…

math.CO2011★ 1 cited

On super edge-graceful trees of diameter four

E. Krop, F. Mutiso, C. Raridan

In "On the super edge graceful trees of even orders," Chung, Lee, Gao, and Schaffer posed the following problem: Characterize trees of diameter 4 which are super edge-graceful. In…

math.CO2011★ 2 cited

On the number of unlabeled vertices in edge-friendly labelings of graphs

Elliot Krop, Sin-Min Lee, Christopher Raridan

Let be a graph with vertex set and edge set , and be a 0-1 labeling of so that the absolute difference in the number of edges labeled 1 and 0 is no more…

math.CO2011

On the edge-balanced index sets of product graphs

Elliot Krop, Sin-Min Lee, Christopher Raridan

We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_…