首頁 > 網路資源 > 大同大學數位論文系統

Title page for etd-0504104-134738


URN etd-0504104-134738 Statistics This thesis had been viewed 2458 times. Download 1592 times.
Author Hao-Wen Chen
Author's Email Address No Public.
Department Math
Year 2003 Semester 1
Degree Master Type of Document Master's Thesis
Language English Page Count 52
Title THE STUDY ON LABELING PROBLEM OF THE POWERS OF CYCLES UNDER DOUBLE CONDITIONS
Keyword
  • labeling problem
  • chromatic number
  • channel assignment problem
  • channel assignment problem
  • chromatic number
  • labeling problem
  • Abstract The double conditions of the labeling problem are as follows. Any two vertices
    in a graph with distance no more than (or ) must have the labels with at least
    (or ) apart. The labeling number of a graph is defined as the smallest positive
    integer such that there exists a labeling satisfying the double conditions. The
    labeling problem of a graph is to find its labeling number and optimal labeling functions.
    The labeling problem has an important application to the channel assignment problem in the wireless network, which is to find the minimum bandwidth such that the requirements for avoiding inference can be satisfied.
    Advisor Committee
  • Hsun-Wen Chang - advisor
  • Jing-Ho Yan - co-chair
  • Nam-Po Chiang - co-chair
  • Files indicate in-campus access immediately and off-campus access at one year
    Date of Defense 2004-01-13 Date of Submission 2004-05-04


    Browse | Search All Available ETDs