Yu-Ping Tsao

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Let S be a finite, nonempty set of positive integers. Then, the divisor graph ) (S D of S has S as its vertex set, and vertices i and j are adjacent if and only if either j i or i j . This paper investigates the vertex-chromatic number, the clique number, the clique cover number, and the independence number of ]) ([n D and its complement, where } , 1 : { ](More)
  • 1