ISSN 2234-8417 (Online) ISSN 1598-5857 (Print)

 
 
 
   
 
Table of Contents
   
 
2014's   32,3-4(May)
   
 
  THE ORIENTABLE NUMBERS OF A GRAPH
    By Byung Kee Kim ..........1526
   
 
 
Generic Number - 1526
References - 0
Written Date - May 16th, 14
Modified Date - May 16th, 14
Downloaded Counts - 1640
Visited Counts - 1394
 
Original File
 
Summary
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.
 
 
   
 
   

ÇÐȸ : Á¤º¸Àü»êÀÀ¿ë¼öÇÐȸ(KSICAM) (±¸: KSCAM & Korean SIGCAM)
http://www.springer.com/journal/12190
¿¬±¸¼Ò : SPCHIN Àü»êÀÀ¿ë¼öÇבּ¸¼Ò ( SPCHIN-CAM Institute : SPCHIN-CAMI)
Copyright ¨Ï 2021 JAMC, JAMI. All rights reserved.  E-mail : sypk47@naver.com
Main Office : c/o Springer Tiergartenstrasse 17 D-69121 Heidelberg, GERMANY. www.springer.com/journal