1 citations · 4 across the 8 of their papers we have counts for
8 papers
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…
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…
Structural properties of Toeplitz graphs
Seyed Ahmad Mojallal, Ji-Hwan Jung, Gi-Sang Cheon +2
In this paper, we study structural properties of Toeplitz graphs. We characterize -free Toeplitz graphs for an integer and give equivalent conditions for a Toeplitz…
Counting independent sets in Riordan graphs
Gi-Sang Cheon, Ji-Hwan Jung, Bumtle Kang +4
The notion of a Riordan graph was introduced recently, and it is a far-reaching generalization of the well-known Pascal graphs and Toeplitz graphs. However, apart from a certain su…
On the safe set of Cartesian product of two complete graphs
Bumtle Kang, Suh-Ryung Kim, Boram Park
For a connected graph , a vertex subset of is a safe set if for every component of the subgraph of induced by , holds for every component …
On consecutive edge magic total labeling of connected bipartite graphs
Bumtle Kang, Suh-Ryung Kim, Ji Yeon Park
Since Sedlá$\breve{\mbox{c}}$ek introduced the notion of magic labeling of a graph in 1963, a variety of magic labelings of a graph have been defined and studied. In this paper, we…