Suh-Ryung Kim

activity

20092024

most citedThe competition hypergraphs of doubly partial orders

12 citations · 60 across the 50 of their papers we have counts for

collaborators

51 papers

math.CO2024

Multipartite tournaments in which any two vertices have an $(i, j)$ -step common out-neighbor

Myungho Choi, Suh-Ryung Kim

We say that a digraph $D$ is $(i, j)$ -step competitive if any two vertices have an $(i, j)$ -step common out-neighbor in $D$ and that a graph $G$ is $(i, j)$ -step competitively orienta…

math.CO2024★ 1 cited

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 $S$ and…

math.CO2024

Competition-common enemy graphs of degree-bounded digraphs

Myungho Choi, Hojin Chu, Suh-Ryung Kim

The competition-common enemy graph (CCE graph) of a digraph $D$ is the graph with the vertex set $V (D)$ and an edge $uv$ if and only if $u$ and $v$ have a common predator and a com…

math.CO2024

Digraphs in which every $t$ vertices share exactly $λ$ out-neighbors and exactly $λ$ in-neighbors

Hojin Chu, Suh-Ryung Kim

In this paper, we introduce the notion of two-way $(t, λ)$ -liking digraphs as a way to extend the results for generalized friendship graphs. A two-way $(t, λ)$ -liking digraph is a di…

math.CO2024

Digraphs in which every $t$ vertices have exactly $λ$ common out-neighbors

Myungho Choi, Hojin Chu, Suh-Ryung Kim

We say that a digraph is a $(t, λ)$ -liking digraph if every $t$ vertices have exactly $λ$ common out-neighbors. In 1975, Plesník [Graphs with a homogeneity, 1975. {\it Glasnik Mathe…

math.CO2024

On $(1, 2)$ -step competition graphs of multipartite tournaments

Myungho Choi, Suh-Ryung Kim

A multipartite tournament is an orientation of a complete $k$ -partite graph for some positive integer $k \geq 3$ . We say that a multipartite tournament $D$ is tight if every partite…

Multipartite tournaments in which any two vertices have an (i,j)-step common out-neighbor

Matrix periods and competition periods of Boolean Toeplitz matrices II

Competition-common enemy graphs of degree-bounded digraphs

Digraphs in which every t vertices share exactly λ out-neighbors and exactly λ in-neighbors

Digraphs in which every t vertices have exactly λ common out-neighbors

On (1,2)-step competition graphs of multipartite tournaments

Multipartite tournaments in which any two vertices have an $(i, j)$ -step common out-neighbor

Digraphs in which every $t$ vertices share exactly $λ$ out-neighbors and exactly $λ$ in-neighbors

Digraphs in which every $t$ vertices have exactly $λ$ common out-neighbors

On $(1, 2)$ -step competition graphs of multipartite tournaments