Title page for etd-0618105-000001


[Back to Results | New Search]

URN etd-0618105-000001
Author Chao-Chi Yang
Author's Email Address filycook@yahoo.com.tw
Statistics This thesis had been viewed 5067 times. Download 1555 times.
Department Applied Mathematics
Year 2004
Semester 2
Degree Master
Type of Document
Language English
Title Perfectness of the complements of circular complete graph
Date of Defense 2005-06-03
Page Count 18
Keyword
  • perfect
  • Abstract For p>=2q,let Kp/q be the graph with vertices 0,1,2,…,p-1 in which
    i~j if q<=|i-j|<=p-q. The circular chromatic number Xc(G) of a graph G is the
    minimum of those p/q for which G admits a homomorphism to Kp/q. The circular clique number Wc(G) of G is the maximum of those p/q for which Kp/q admits a homomorphism to G.. A graph G is circular perfect if for every induced subgraph
    H of G we have Xc(H)=Wc(H). In this paper,we characterize those rational
    numbers p/q for which the complement of Kp/q are circular perfect. We also prove
    that if G(n,S) is a circulant graph whose generating set S has cardinality at most
    3,then G(n,S) is circular perfect.
    Advisory Committee
  • D. J. Guan - chair
  • Tsai-Lien Wong - co-chair
  • Li-Da Tong - co-chair
  • Xuding Zhu - advisor
  • Files
  • etd-0618105-000001.pdf
  • indicate access worldwide
    Date of Submission 2005-06-18

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys