Soogang Eoh

collaborators

5 papers

math.CO2019

Using $p$ -row graphs to study $p$ -competition graphs

Soogang Eoh, Taehee Hong, Suh-Ryung Kim +1

For a positive integer $p$ , the $p$ -competition graph of a digraph $D$ is a graph which has the same vertex set as $D$ and an edge between distinct vertices $x$ and $y$ if and only…

math.CO2019

The phylogeny number in the aspect of triangles and diamonds of a graph

Soogang Eoh, Suh-Ryung Kim, Hojun Lee

Given an acyclic digraph $D$ , the competition graph of $D$ , denoted by $C (D)$ , is the simple graph having vertex set $V (D)$ and edge set $\{uv \mid (u, w), (v, w) \in A(D) \text{ f…

math.CO2019

On weak majority dimensions of digraphs

Soogang Eoh, Suh-Ryung Kim

In this paper, we introduce the notion of the weak majority dimension of a digraph which is well-defined for any digraph. We first study properties shared by the weak dimension of…

math.CO2019

On $m$ -step competition graphs of bipartite tournaments

Soogang Eoh, Suh-Ryung Kim, Hyesun Yoon

In this paper, we completely characterize the $m$ -step competition graph of a bipartite tournament for any integer $m \geq 2$ . In addition, we compute the competition index and the…

math.CO2016

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

Jihoon Choi, Soogang Eoh, Suh-Ryung Kim +1

In this paper, we study $(1, 2)$ -step competition graphs of bipartite tournaments. A bipartite tournament means an orientation of a complete bipartite graph. We show that the $(1,2)…

Using p-row graphs to study p-competition graphs

The phylogeny number in the aspect of triangles and diamonds of a graph

On weak majority dimensions of digraphs

On m-step competition graphs of bipartite tournaments

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

Using $p$ -row graphs to study $p$ -competition graphs

On $m$ -step competition graphs of bipartite tournaments

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