8 papers · 1 filter
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…