#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1991

2017

- This year (6)
- Last 5 years (19)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Han Hyuk Cho, Suh-Ryung Kim
- Discrete Applied Mathematics
- 2005

Let D be an acyclic digraph. The competition graph of D has the same set of vertices as D and an edge between vertices u and v if and only if there is a vertex x in D such that (u, x) and (v, x) are arcs of D. In this paper, we show that the competition graphs of doubly partial orders are interval graphs. We also show that an interval graph together with… (More)

- Suh-Ryung Kim, Yoshio Sano
- Discrete Applied Mathematics
- 2008

For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition numbers of complete tripartite graphs.

- Seog-Jin Kim, Suh-Ryung Kim, Yoomi Rho
- Discrete Applied Mathematics
- 2007

Let D be a digraph. The competition-common enemy graph (CCE graph) of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w, u), (w, v), (u, x), and (v, x) are arcs of D. We call a graph a CCE graph if it is the CCE graph of some digraph. In this paper, we show that if the CCE… (More)

- Suh-Ryung Kim, Fred S. Roberts
- Ars Comb.
- 1998

- Suh-Ryung Kim, Fred S. Roberts
- Discrete Applied Mathematics
- 1997

- Han Hyuk Cho, Suh-Ryung Kim
- Discrete Mathematics
- 2005

- Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam
- Discrete Applied Mathematics
- 2000

The competition graph of a digraph was introduced by Cohen in 1968 associated with the study of ecosystems. Since then, the competition graph has been widely studied and many variations have been introduced. In this paper, we de ne and study the m-step competition graph of a digraph which is another generalization of competition graph. ? 2000 Elsevier… (More)

- Han Hyuk Cho, Suh-Ryung Kim, J. Richard Lundgren
- Discrete Mathematics
- 2002

- Boram Park, Suh-Ryung Kim, Yoshio Sano
- Discrete Mathematics
- 2009

- Suh-Ryung Kim, Fred S. Roberts
- Ars Comb.
- 2002

Given a digraph D, its competition graph has the same vertex set and an edge between two vertices x and y if there is a vertex u so that (x, u) and (y, u) are arcs of D. Motivated by a problem of communications, we study the competition graphs of the special digraphs known as semiorders. This leads us to define a conditions on digraphs called C(p) and C(p)… (More)