Ji-Hwan Jung

Ji-Hwan Jung

Auto-generated profile, based on publicly available information

Ji-Hwan Jung

Applied Algebra and Optimization Research Center Department of Mathematics Sungkyunkwan University 16419 Suwon Republic of Korea

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2018 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
GCGi-Sang Cheon
Gi-Sang Cheon
JJJi-Hwan Jung
Ji-Hwan Jung
PBPaul Barry
Paul Barry

22 January 2018 in arXiv
Verified
Preprint
Open access
PDF file
GCGi-Sang Cheon
Gi-Sang Cheon
JJJi-Hwan Jung
Ji-Hwan Jung
SKSergey Kitaev
Sergey Kitaev
SMSeyed Ahmad Mojallal
Seyed Ahmad Mojallal
The authors of this paper have used the theory of Riordan matrices to introduce the notion of a Riordan graph in \cite{CJKM}. Riordan graphs are proved to have a number of interesting (fractal) properties, and they are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other families of graphs. The main focus in \cite{CJKM} is the study of structural properties of families of Riordan graphs obtained from certain infinite Riordan graphs. In this paper, we use a number of results in~\cite{CJKM} to study spectral properties of Riordan graphs. Our studies include, but are not limited to the spectral graph invariants for Riordan graphs such as the adjacency eigenvalues, (signless) Laplacian eigenvalues, nullity, positive and negative inertias, and rank. We also study determinants of Riordan graphs, in particular, giving results about determinants of Catalan graphs.

13 April 2019 in arXiv
Verified
Preprint
Open access
PDF file
GCGi-Sang Cheon
Gi-Sang Cheon
JJJi-Hwan Jung
Ji-Hwan Jung
SKSergey Kitaev
Sergey Kitaev
SMSeyed Ahmad Mojallal
Seyed Ahmad Mojallal
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other families of graphs. The Riordan graphs are proved to have a number of interesting (fractal) properties, which can be useful in creating computer networks with certain desirable features, or in obtaining useful information when designing algorithms to compute values of graph invariants. The main focus in this paper is the study of structural properties of families of Riordan graphs obtained from infinite Riordan graphs, which includes a fundamental decomposition theorem and certain conditions on Riordan graphs to have an Eulerian trail/cycle or a Hamiltonian cycle. We will study spectral properties of the Riordan graphs in a follow up paper.

31 January 2019 in arXiv
Verified
Preprint
Open access
PDF file
JJJi-Hwan Jung
Ji-Hwan Jung
Recently, in the paper \cite{CJKM1} we suggested the two conjectures about the diameter of io-decomposable Riordan graphs of the Bell type. In this paper, we give a counterexample for the first conjecture. Then we prove that the first conjecture is true for the graphs of some particular size and propose a new conjecture. Finally, we show that the second conjecture is true for some special io-decomposable Riordan graphs.