default search action
Gi-Sang Cheon
Person information
- affiliation: Sungkyunkwan University, Suwon, Republic of Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j25]Gi-Sang Cheon
, Hong Joon Choi, Guillermo Esteban
Enumeration of bipartite non-crossing geometric graphs. Discret. Appl. Math. 317: 86-100 (2022) - [j24]Seyed Ahmad Mojallal, Ji-Hwan Jung, Gi-Sang Cheon
Structural properties of Toeplitz graphs. Discret. Math. 345(11): 113016 (2022) - 2020
- [j23]Gi-Sang Cheon
Counting independent sets in Riordan graphs. Discret. Math. 343(11): 112043 (2020)
2010 – 2019
- 2019
- [j22]Gi-Sang Cheon, Jinha Kim
Word-representability of Toeplitz graphs. Discret. Appl. Math. 270: 96-105 (2019) - 2014
- [j21]Gi-Sang Cheon
An application of Riordan arrays to the transient analysis of M/M/1 queues. Appl. Math. Comput. 237: 659-671 (2014) - 2013
- [j20]Gi-Sang Cheon
Generalized Bessel numbers and some combinatorial settings. Discret. Math. 313(20): 2127-2138 (2013) - 2012
- [j19]Gi-Sang Cheon
The uplift principle for ordered trees. Appl. Math. Lett. 25(6): 1010-1015 (2012) - [j18]Gi-Sang Cheon
Combinatorics of Riordan arrays with identical A and Z sequences. Discret. Math. 312(12-13): 2040-2049 (2012) - [j17]Gi-Sang Cheon
r-Whitney numbers of Dowling lattices. Discret. Math. 312(15): 2337-2348 (2012) - 2011
- [j16]Gi-Sang Cheon
Rational combinations for the sums involving inverse binomial coefficients. Appl. Math. Comput. 218(6): 2641-2646 (2011) - [j15]Gi-Sang Cheon
The hitting time subgroup, Lukasiewicz paths and Faber polynomials. Eur. J. Comb. 32(1): 82-91 (2011) - 2010
- [j14]Gi-Sang Cheon
The Fine numbers refined. Eur. J. Comb. 31(1): 120-128 (2010) - [j13]Kinkar Chandra Das, Sang-Gu Lee
On the conjecture for certain Laplacian integral spectrum of graphs. J. Graph Theory 63(2): 106-113 (2010)
2000 – 2009
- 2009
- [j12]Gi-Sang Cheon
A generalization of Lucas polynomial sequence. Discret. Appl. Math. 157(5): 920-927 (2009) - [j11]Gi-Sang Cheon
Riordan group involutions and the Delta-sequence. Discret. Appl. Math. 157(8): 1696-1701 (2009) - 2008
- [j10]Gi-Sang Cheon
Protected points in ordered trees. Appl. Math. Lett. 21(5): 516-520 (2008) - 2007
- [j9]Gi-Sang Cheon
Several polynomials associated with the harmonic numbers. Discret. Appl. Math. 155(18): 2573-2584 (2007) - [j8]Gi-Sang Cheon
An interpretation of the Dittert conjecture in terms of semi-matchings. Discret. Math. 307(21): 2501-2507 (2007) - 2005
- [j7]Moawwad E. A. El-Mikkawy, Gi-Sang Cheon
Combinatorial and hypergeometric identities via the Legendre polynomials--A computational approach. Appl. Math. Comput. 166(1): 181-195 (2005) - 2004
- [j6]Gi-Sang Cheon
Extended symmetric Pascal matrices via hypergeometric functions. Appl. Math. Comput. 158(1): 159-168 (2004) - 2003
- [j5]Gi-Sang Cheon
A note on the Bernoulli and Euler polynomials. Appl. Math. Lett. 16(3): 365-368 (2003) - [j4]Moawwad E. A. El-Mikkawy, Gi-Sang Cheon
A connection between a generalized Pascal matrix and the hypergeometric function. Appl. Math. Lett. 16(8): 1239-1243 (2003) - [j3]Gi-Sang Cheon
Root Polynomials to and From Permanents. Discret. Math. 264(1-3): 25-36 (2003) - 2000
- [j2]Gi-Sang Cheon, Bryan L. Shader
Sparse orthogonal matrices and the Haar wavelet. Discret. Appl. Math. 101(1-3): 63-76 (2000)
1990 – 1999
- 1999
- [j1]Gi-Sang Cheon
How Sparse Can a Matrix with Orthogonal Rows Be? J. Comb. Theory A 85(1): 29-40 (1999)
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-06-10 21:20 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: