论文信息 - The competition graphs of oriented complete bipartite graphs

The competition graphs of oriented complete bipartite graphs

In this paper, we study the competition graphs of oriented complete bipartite graphs. We characterize graphs that can be represented as the competition graphs of oriented complete bipartite graphs. We also present the graphs having the maximum number of edges and the graphs having the minimum number of edges among such graphs.

Boram Park | Jung Yeun Lee | Suh-Ryung Kim | Yoshio Sano

[1] James D. Factor. Domination Graphs of Extended Rotational Tournaments: Chords and Cycles , 2007, Ars Comb..

[2] J. Richard Lundgren,et al. Food Webs, Competition Graphs, Competition-Common Enemy Graphs, and Niche Graphs , 1989 .

[3] Han Hyuk Cho,et al. Domination graphs of regular tournaments , 2002, Discret. Math..

[4] Boram Park,et al. The competition number of the complement of a cycle , 2013, Discret. Appl. Math..

[5] Suh-Ryung Kim,et al. The Competition Number and its Variants , 1993 .

[6] Suh-Ryung Kim,et al. The competition numbers of complete tripartite graphs , 2008, Discret. Appl. Math..

[7] Boram Park,et al. The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares , 2009, Discret. Math..

[8] Boram Park,et al. The competition numbers of complete multipartite graphs with many partite sets , 2012, Discret. Appl. Math..

[9] K. Brooks Reid,et al. Domination Graphs of Tournaments with Isolated Vertices , 2003, Ars Comb..

[10] K. Brooks Reid,et al. The domination and competition graphs of a tournament , 1998, J. Graph Theory.