2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2012
On the k-edge magic graphs
Sin-Min Lee, Saeid Alikhani, Gee-Choon Lau +1
Let be a graph with vertex set V and edge set E such that |V| = p and |E| = q. For integers k\geq 0, define an edge labeling f : E \rightarrow \{k,k+1,....,k+q-1\} and define t…
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_…