default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJongyook Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j19]Jack H. Koolen, Chenhui Lv, Jongyook Park, Qianqian Yang:
Bounding the intersection number c2 of a distance-regular graph with classical parameters (D,b,α,β) in terms of b. Discret. Math. 348(2): 114239 (2025)- 2023
- [j18]Suil O
, Jeong Rye Park, Jongyook Park, Wenqian Zhang:
Sharp spectral bounds for the edge-connectivity of regular graphs. Eur. J. Comb. 110: 103713 (2023) - [j17]Ying-Ying Tan, Jack H. Koolen, Mengyue Cao, Jongyook Park:
Correction to: Thin Q-Polynomial Distance-Regular Graphs Have Bounded c2. Graphs Comb. 39(1): 12 (2023) - 2022
- [j16]Yanhua Zhao, Jongyook Park:
A Spectral Condition for the Existence of the Square of a Path. Graphs Comb. 38(4): 126 (2022) - [j15]Ying-Ying Tan, Jack H. Koolen, Mengyue Cao, Jongyook Park:
Thin Q-Polynomial Distance-Regular Graphs Have Bounded c2. Graphs Comb. 38(6): 175 (2022) - 2021
- [j14]Gary R. W. Greaves, Jack H. Koolen, Jongyook Park:
Augmenting the Delsarte bound: A forbidden interval for the order of maximal cliques in strongly regular graphs. Eur. J. Comb. 97: 103384 (2021) - 2020
- [j13]Ivan Guo, Jack H. Koolen, Greg Markowsky, Jongyook Park:
On the nonexistence of pseudo-generalized quadrangles. Eur. J. Comb. 89: 103128 (2020) - 2019
- [j12]Zhi Qiao, Jongyook Park, Jack H. Koolen:
On 2-walk-regular graphs with a large intersection number c2. Eur. J. Comb. 80: 224-235 (2019) - [j11]Jack H. Koolen, Quaid Iqbal, Jongyook Park, Masood Ur Rehman:
There Does Not Exist a Distance-Regular Graph with Intersection Array {80, 54, 12; 1, 6, 60}. Graphs Comb. 35(6): 1597-1608 (2019) - 2018
- [j10]Edwin R. van Dam, Jack H. Koolen, Jongyook Park:
Partially metric association schemes with a multiplicity three. J. Comb. Theory B 130: 19-48 (2018) - 2017
- [j9]Jongyook Park:
The distance-regular graphs with valency k≥2, diameter D≥3 and kD-1+kD≤2k. Discret. Math. 340(3): 550-561 (2017) - 2015
- [j8]Sejeong Bang, Jack H. Koolen, Jongyook Park:
Some Results on the Eigenvalues of Distance-Regular Graphs. Graphs Comb. 31(6): 1841-1853 (2015) - 2013
- [j7]Jack H. Koolen, Joohyung Kim, Jongyook Park:
Distance-Regular Graphs with a Relatively Small Eigenvalue Multiplicity. Electron. J. Comb. 20(1): 1 (2013) - [j6]Jack H. Koolen, Greg Markowsky, Jongyook Park:
On electric resistances for distance-regular graphs. Eur. J. Comb. 34(4): 770-786 (2013) - [j5]Jack H. Koolen, Jongyook Park:
A note on distance-regular graphs with a small number of vertices compared to the valency. Eur. J. Comb. 34(6): 935-940 (2013) - [j4]Jongyook Park, Jack H. Koolen, Greg Markowsky:
There are only finitely many distance-regular graphs with valency k at least three, fixed ratio k2/k and large diameter. J. Comb. Theory B 103(6): 733-741 (2013) - 2012
- [j3]Jack H. Koolen, Jongyook Park:
A relationship between the diameter and the intersection number c 2 for a distance-regular graph. Des. Codes Cryptogr. 65(1-2): 55-63 (2012) - [j2]Jack H. Koolen, Jongyook Park:
Distance-regular graphs with a2 or c2 at least half the valency. J. Comb. Theory A 119(3): 546-555 (2012) - 2010
- [j1]Jack H. Koolen, Jongyook Park:
Shilla distance-regular graphs. Eur. J. Comb. 31(8): 2064-2073 (2010)
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-01 21:37 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:
