default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSin-Min Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j24]Kooi-Kuan Yoong
, Roslan Hasni, Muhammad Irfan, Ibrahim Taraweh, Ali Ahmad, Sin-Min Lee:
On the edge irregular reflexive labeling of corona product of graphs with path. AKCE Int. J. Graphs Comb. 18(1): 53-59 (2021)- 2020
- [j23]Ibrahim Tarawneh, Roslan Hasni, Ali Ahmad, Gee-Choon Lau, Sin-Min Lee:
On the edge irregularity strength of corona product of graphs with cycle. Discret. Math. Algorithms Appl. 12(6): 2050083:1-2050083:18 (2020)
2010 – 2019
- 2019
- [j22]Sin-Min Lee, Richard M. Low, Ho-Kuen Ng, Y.-C. Wang:
On friendly index sets of k-galaxies. Electron. J. Graph Theory Appl. 7(1): 1-10 (2019) - 2016
- [j21]Gee-Choon Lau, Zhen-Bin Gao, Sin-Min Lee, Guang-Yi Sun:
On friendly index sets of the edge-gluing of complete graph and cycles. AKCE Int. J. Graphs Comb. 13(2): 107-111 (2016) - [j20]Guang-Yi Sun, Zhen-Bin Gao, Sin-Min Lee:
On full friendly index sets of twisted product of Mobius ladders. Ars Comb. 128: 225-239 (2016) - [j19]Zhen-Bin Gao, Guang-Yi Sun, Sin-Min Lee:
On full friendly index sets of 1-level and 2-levels N-grids. Discret. Appl. Math. 211: 68-78 (2016) - 2015
- [j18]Gee-Choon Lau, Saeid Alikhani, Sin-Min Lee, William L. Kocay:
On k-edge-magic labelings of maximal outerplanar graphs. AKCE Int. J. Graphs Comb. 12(1): 40-46 (2015) - 2014
- [j17]Saeid Alikhani, William L. Kocay, Gee-Choon Lau, Sin-Min Lee:
On the k-edge magic graphs. Electron. Notes Discret. Math. 45: 35-41 (2014) - 2012
- [j16]Harris Kwong, Sin-Min Lee, Sheng-Ping Bill Lo, Hsin-Hao Su, Yung-Chin Wang:
On uniformly balanced graphs. Australas. J Comb. 53: 83-96 (2012) - [j15]Sin-Min Lee:
On Constructions which yield Fully Magic Graphs. Ars Comb. 107: 385-409 (2012) - [j14]Elliot Krop, Sin-Min Lee, Christopher Raridan:
On the number of unlabeled vertices in edge-friendly labelings of graphs. Discret. Math. 312(3): 574-577 (2012)
2000 – 2009
- 2008
- [j13]Sin-Min Lee, Ho Kuen Ng:
On Friendly Index Sets of Bipartite Graphs. Ars Comb. 86 (2008) - [j12]Harris Kwong, Sin-Min Lee, Ho Kuen Ng:
On friendly index sets of 2-regular graphs. Discret. Math. 308(23): 5522-5532 (2008) - [j11]Tao-Ming Wang, Cheng-Chih Hsiao, Sin-Min Lee:
A note on edge-graceful spectra of the square of paths. Discret. Math. 308(23): 5878-5885 (2008) - 2006
- [j10]Richard M. Low, Sin-Min Lee:
On the products of group-magic graphs. Australas. J Comb. 34: 41-48 (2006) - [j9]Richard M. Low, Sin-Min Lee:
On the integer-magic spectra of tessellation graphs. Australas. J Comb. 34: 195-210 (2006) - [j8]Yihui Wen, Sin-Min Lee, Hugo Sun:
On the Supermagic Edge-splitting Extension of Graphs. Ars Comb. 79 (2006) - [j7]Gary Chartrand, Sin-Min Lee, Ping Zhang:
Uniformly cordial graphs. Discret. Math. 306(8-9): 726-737 (2006) - 2005
- [j6]Ebrahim Salehi, Sin-Min Lee, Mahdad Khatirinejad:
IC-Colorings and IC-Indices of graphs. Discret. Math. 299(1-3): 297-310 (2005) - 2003
- [j5]Sin-Min Lee, Ebrahim Salehi:
Integer-Magic Spectra Of Amalgamations Of Stars And Cycles. Ars Comb. 67 (2003) - 2002
- [j4]Wai Chee Shiu, Peter C. B. Lam, Sin-Min Lee:
Edge-magic Indices of (n, n - 1)-graphs. Electron. Notes Discret. Math. 11: 443-458 (2002)
1990 – 1999
- 1997
- [j3]M. C. Kong, Sin-Min Lee, Hugo S. H. Sun:
On Magic Strength of Graph. Ars Comb. 45 (1997) - 1991
- [j2]Sin-Min Lee, Edward F. Schmeichel, S. C. Shee:
On felicitous graphs. Discret. Math. 93(2-3): 201-209 (1991)
1980 – 1989
- 1987
- [j1]Sin-Min Lee, John Mitchem:
An upper bound for the harmonious chromatic number of a graph. J. Graph Theory 11(4): 565-567 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
