Publications
Detailed Information
The (i,j)-step competition graphs of oriented complete bipartite graphs : 방향 지어진 완전이분그래프의 (i,j)-step 경쟁그래프
Cited 0 time in
Web of Science
Cited 0 time in Scopus
- Authors
- Advisor
- 김서령
- Major
- 사범대학 수학교육과
- Issue Date
- 2015-08
- Publisher
- 서울대학교 대학원
- Keywords
- complete bipartite graphs ; (1 ; 2)-step competition graphs ; (1 ; 2)-step competition-realizable ; (i ; j)-step competition graphs ; limits of (i ; j)-step competition graphs ; orientations
- Description
- 학위논문 (석사)-- 서울대학교 대학원 : 수학교육과, 2015. 8. 김서령.
- Abstract
- In this thesis, we study the (i,j)-step competition graph of an oriented complete bipartite graph. Kim et al. studied the competition graph of an oriented complete bipartite graph. We take a further step to study the (1,2)-step competition graph of an oriented complete bipartite graph by extending the results given by Kim et al. Then we study (i,j)-step competition graph, a more general version of (1,2)-step competition graph. Finally, we deal with the limit of (i,j)-step competition graph.
- Language
- English
- Files in This Item:
- Appears in Collections:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.