政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/36402
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113822/144841 (79%)
Visitors : 51831084      Online Users : 541
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/36402


    Title: 對偶超圖之著色數探討
    The Chromatic Number of A Dual Hypergraph
    Authors: 莊佳芬
    Jhuang, Jia-Fen
    Contributors: 張宜武
    Chang, Yi-Wu
    莊佳芬
    Jhuang, Jia-Fen
    Keywords: 對偶超圖
    同構
    Dual hypergraph
    Transversal number
    Isomorphism
    Date: 2004
    Issue Date: 2009-09-18 18:29:06 (UTC+8)
    Abstract: 本文藉構造bipartite graph 的形式討論超圖與對偶超圖的transversal number，進而探討最小著色數的上界，以及證明出此兩圖的最小著色數可差異很大，也可用此方法構造出想要的最小著色數之差異。最後探討在某些情形下，超圖與其對偶超圖的同構性，再則整理出其必要條件。
    H=(X,D) is called a hypergraph, where X is the vertex set and D is a family of subsets of X, denoted as D-edges, and we assume that every D-edges have at least two elements. A strict t-coloring is a onto mapping from X to {1,2,....,t} such that each D contained in D-edge set has two vertices having distinct values. The maximum(minimum) number of colors over all strict k-coloring is called the upper(lower) chromatic number and is denoted as .
    Abstract.......................................................i
    1.Introduction.................................................1
    2.The difference between the transversal numbers of H and H*...4
    3.Isomorphism.................................................12
    4.Conclusions.................................................16
    References....................................................17
    Reference: [1] Claude Berge. (1973). ""Graphs and hypergraphs"" North-Holland
    [2] Claude Berge. (1989). ""Hypergraphs"" North-Holland
    [3] Voloshin, V.~I. (1995). ""On the upper chromatic number of a hypergraph`` Australasian Journal of Combinatorics, 25--45.
    [4] Voloshin, V. I. (2002). ""Coloring mixed hypergraphs: theorey, algorithms and
    applications`` American Mathematical Society
    [5] Bulgaru, M., and Voloshin, V.~I. (1997). ""Mixed interval hypergraphs`` Discrete Applied Mathematics, 77,29--41.
    [6] Jiang, T., Mubayi, D., Tuza, Z., Voloshin, V., and West, D.~B.(2003). ""The chromatic spectrum of mixed hypergraphs,``Graphs and Combinatorics, 309--318.
    [7] Kr\\`{a}l`, D., Kratochv\\`{i}l, J., and Voss, H.~J. (2004). ""Mixed hypercacti,`` Discrete Math., 286, 99--113.
    [8] Gionfriddo, M., Milazzo, L., and Voloshin, V. (2002). ""On the upper chromatic index of a multigraph,`` Comput. Sci.J.Moldova,81--91
    Description: 碩士
    國立政治大學
    應用數學研究所
    91751013
    93
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0917510131
    Data Type: thesis
    Appears in Collections:[Department of Mathematical Sciences] Theses

    Files in This Item:

    File SizeFormat
    index.html0KbHTML2418View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback