2 citations · 3 across the 11 of their papers we have counts for
5 papers · 1 filter
The niche graphs of multipartite tournaments
Soogang Eoh, Myungho Choi, Suh-Ryung Kim
The niche graph of a digraph has as the vertex set and an edge if and only if and , or and for so…
Using -row graphs to study -competition graphs
Soogang Eoh, Taehee Hong, Suh-Ryung Kim +1
For a positive integer , the -competition graph of a digraph is a graph which has the same vertex set as and an edge between distinct vertices and if and only…
The phylogeny number in the aspect of triangles and diamonds of a graph
Soogang Eoh, Suh-Ryung Kim, Hojun Lee
Given an acyclic digraph , the competition graph of , denoted by , is the simple graph having vertex set and edge set $\{uv \mid (u, w), (v, w) \in A(D) \text{ f…
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…
On -step competition graphs of bipartite tournaments
Soogang Eoh, Suh-Ryung Kim, Hyesun Yoon
In this paper, we completely characterize the -step competition graph of a bipartite tournament for any integer . In addition, we compute the competition index and the…