Publications
Detailed Information
m-step competition graphs of bipartite tournaments : 방향 지어진 완전 이분 그래프의 m-step 경쟁 그래프
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 김서령 | - |
| dc.contributor.author | 윤혜선 | - |
| dc.date.accessioned | 2018-05-29T04:22:29Z | - |
| dc.date.available | 2018-05-29T04:22:29Z | - |
| dc.date.issued | 2018-02 | - |
| dc.identifier.other | 000000150710 | - |
| dc.identifier.uri | https://hdl.handle.net/10371/142025 | - |
| dc.description | 학위논문 (석사)-- 서울대학교 대학원 : 사범대학 수학교육과, 2018. 2. 김서령. | - |
| dc.description.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. | - |
| dc.description.tableofcontents | 1 Introduction 1
1.1 Basic graph terminology 1 1.2 Competition graph and its variants 3 1.3 m-step competition graphs 5 1.4 Polya's theory of counting 6 1.5 Competition indices and competition periods 9 1.6 Preview of thesis 10 2 The number of distinct bipartite tournaments 12 3 Properties of m-step competition graphs of bipartite tournaments 18 4 m-step competition realizable pairs 23 5 Extremal cases 31 6 Concluding remarks 36 | - |
| dc.format | application/pdf | - |
| dc.format.extent | 971050 bytes | - |
| dc.format.medium | application/pdf | - |
| dc.language.iso | en | - |
| dc.publisher | 서울대학교 대학원 | - |
| dc.subject | complete bipartite graph | - |
| dc.subject | bipartite tournament | - |
| dc.subject | m-step competition graph | - |
| dc.subject | competition index | - |
| dc.subject | competition period | - |
| dc.subject | m-step competition realizable | - |
| dc.subject.ddc | 510.7 | - |
| dc.title | m-step competition graphs of bipartite tournaments | - |
| dc.title.alternative | 방향 지어진 완전 이분 그래프의 m-step 경쟁 그래프 | - |
| dc.type | Thesis | - |
| dc.contributor.AlternativeAuthor | Hyesun Yoon | - |
| dc.description.degree | Master | - |
| dc.contributor.affiliation | 사범대학 수학교육과 | - |
| dc.date.awarded | 2018-02 | - |
- Appears in Collections:
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.