S-Space College of Education (사범대학) Dept. of Mathematics Education (수학교육과) Theses (Master's Degree_수학교육과)
m-step competition graphs of bipartite tournaments
방향 지어진 완전 이분 그래프의 m-step 경쟁 그래프
- 사범대학 수학교육과
- Issue Date
- 서울대학교 대학원
- complete bipartite graph; bipartite tournament; m-step competition graph; competition index; competition period; m-step competition realizable
- 학위논문 (석사)-- 서울대학교 대학원 : 사범대학 수학교육과, 2018. 2. 김서령.
- In this thesis, we study the m-step competition graphs of bipartite tournaments. We compute the number of distinct bipartite tournaments by Polya's theory of counting. Then we study the competition indices and competition periods of bipartite tournaments. We characterize the pairs of graphs that can be represented as the m-step competition graphs of bipartite tournaments. Finally, we present the maximum number of edges and the minimum number of edges which the m-step competition graph of a bipartite tournament might have.