Browse

m-step competition graphs of bipartite tournaments
방향 지어진 완전 이분 그래프의 m-step 경쟁 그래프

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors
윤혜선
Advisor
김서령
Major
사범대학 수학교육과
Issue Date
2018-02
Publisher
서울대학교 대학원
Keywords
complete bipartite graphbipartite tournamentm-step competition graphcompetition indexcompetition periodm-step competition realizable
Description
학위논문 (석사)-- 서울대학교 대학원 : 사범대학 수학교육과, 2018. 2. 김서령.
Abstract
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.
Language
English
URI
https://hdl.handle.net/10371/142025
Files in This Item:
Appears in Collections:
College of Education (사범대학)Dept. of Mathematics Education (수학교육과)Theses (Master's Degree_수학교육과)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse