- THE ORIENTABLE NUMBERS OF A GRAPH
- THE ORIENTABLE NUMBERS OF A GRAPH
- ㆍ 저자명
- Kim. Byung Kee
- ㆍ 간행물명
- Journal of applied mathematics & informatics
- ㆍ 권/호정보
- 2014년|32권 3호|pp.503-509 (7 pages)
- ㆍ 발행정보
- 한국전산응용수학회
- ㆍ 파일정보
- 정기간행물|ENG| PDF텍스트
- ㆍ 주제분야
- 기타
For a connected graph G, there are orientations of G have different hull numbers, geodetic numbers, and convexity numbers. The lower orientable hull number $h^-(G)$ is defined as the minimum hull number among all the orientations of G and the upper orientable hull number $h^+(G)$ as the maximum hull number among all the orientations of G. The lower and upper orientable geodetic numbers $g^-(G)$ and $g^+(G)$ are defined similarily. In this paper, We investigate characterizations of the orientable numbers and the conditions that the relation $h^-(G){leq}g^-(G)$ < $h^+(G){leq}g^+(G)$ holds.