Title page for etd-0213101-134241


[Back to Results | New Search]

URN etd-0213101-134241
Author fu-qun Li
Author's Email Address fortran2@ms57.hinet.net
Statistics This thesis had been viewed 5067 times. Download 2324 times.
Department Applied Mathematics
Year 2000
Semester 1
Degree Master
Type of Document
Language English
Title Chromatic number of integral distance graph
Date of Defense 2001-01-12
Page Count 17
Keyword
  • integral distance graph
  • Chromatic number.
  • Abstract Abstract
    For a set D of positive integers, the integral distance graph G(Z, D) is the graph with vertex set Z and edge set { xy : x, y 2 Z and | x − y | 2 D } . An integral distance graph G(Z, D) is called “locally dense” if the clique size of G(Z, D) is not less to | D | . This paper acterizes
    locally dense integral distance graphs and determine their chromatic numbers.
    Advisory Committee
  • D. J. Guan - chair
  • Chia-Hsin Liu - co-chair
  • Tsai-Lien Wong - co-chair
  • Xuding Zhu - advisor
  • Files
  • Thesis.pdf
  • indicate access worldwide
    Date of Submission 2001-02-13

    [Back to Results | New Search]


    Browse | Search All Available ETDs

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