1 citations · 4 across the 11 of their papers we have counts for
11 papers
Connectivity keeping paths in digraphs
Hojin Chu, Boram Park, Homoon Ryu
Mader conjectured that every -strong digraph with minimum semidegree contains a dipath of order such that remains -strong. For ,…
On 2-connected graphs without cycles of length 1 modulo 3
Yandong Bai, Hojin Chu, Binlong Li +2
Burr and Erdős conjectured in 1976 that for all integers such that contains an even integer, every -vertex graph without cycles of length $\ell…
Connectivity keeping trees in triangle-free graphs
Hojin Chu, Shinya Fujita, Boram Park +1
In 2012, Mader conjectured that for any tree of order , every -connected graph with minimum degree at least contains a subtree $T'\c…
On -connected graphs avoiding cycles of length modulo
Hojin Chu, Boram Park, Homoon Ryu
For two integers and , an -cycle means a cycle of length such that . In 1977, Bollobás proved a conjecture of Burr and Erd…
Linear-Time Computation of the Frobenius Normal Form for Symmetric Toeplitz Matrices via Graph-Theoretic Decomposition
Hojin Chu, Homoon Ryu
We introduce a linear-time algorithm for computing the Frobenius normal form (FNF) of symmetric Toeplitz matrices by utilizing their inherent structural properties through a graph-…
Structural properties of a symmetric Toeplitz and Hankel matrices
Hojin Chu, Homoon Ryu
In this paper, we investigate properties of a symmetric Toeplitz matrix and a Hankel matrix by studying the components of its graph. To this end, we introduce the notion of ``weigh…
Matrix periods and competition periods of Boolean Toeplitz matrices II
Gi-Sang Cheon, Bumtle Kang, Suh-Ryung Kim +1
This paper is a follow-up to the paper [Matrix periods and competition periods of Boolean Toeplitz matrices, {\it Linear Algebra Appl.} 672:228--250, (2023)]. Given subsets and…
Row graphs of Toeplitz matrices
Gi-Sang Cheon, Bumtle Kang, Suh-Ryung Kim +1
In this paper, we study row graphs of Toeplitz matrices. The notion of row graphs was introduced by Greenberg et al. in 1984 and is closely related to the notion of competition gra…
Matrix periods and competition periods of Boolean Toeplitz matrices
Gi-Sang Cheon, Bumtle Kang, Suh-Ryung Kim +1
In this paper, we study the matrix period and the competition period of Toeplitz matrices over a binary Boolean ring . Given subsets and of $\{1,\ldot…
Planarity of generalized ladder graphs
Hojin Chu, Suh-Ryung Kim, Homoon Ryu
The Cartesian product of P_2 and P_n is called an n-ladder graph for a positive integer n. We call two paths P_m and P_n together with some edges each of which joins a vertex on P_…
On Toeplitz graphs being line graphs
Gi-Sang Cheon, Bumtle Kang, Suh-Ryung Kim +2
A Toeplitz graph is a simple graph with the vertex set such that two vertices and are adjacent if and only if fo…