English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 109874/140825 (78%)
Visitors : 45914046      Online Users : 906
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
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 學位論文 >  Item 140.119/32563
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/32563


    Title: Gap in (l,m)-uniform mixed hypergraph
    Authors: 楊瑞章
    Contributors: 張宜武
    楊瑞章
    Keywords: gap
    mixed hypergraph
    (l,m)-uniform
    spectrum
    Date: 2002
    Issue Date: 2009-09-17 13:45:26 (UTC+8)
    Abstract: (l,m)-uniform混和超級圖的色譜一定是是連續的, 利用一個技巧讓所有l大於二的(l,m)-uniform混和超級圖都存在一組C-edges 和 D-edges, 使得光譜不連續.最後提供一個演算法, 讓所有l和m 都大於二的(l,m)-uniform混和超級圖, 也存在一組 C-edges 和 D-edges, 使得光譜不連續. 這樣我們就已經討論完所有(l,m)-uniform混和超級圖( l , m 都要大於等於 2), 其光譜是否存在著有不連續的可能.
    In this thesis, we study all existences of gap in every kind of (l,m)-uniform mixed hypergraph, where n > 1 and m > 1. We have to divide the topic into three parts: (2,m)-uniform mixed hypergraph where m > 1, (l,2)-uniform mixed hypergraph
    where l > 2, and (l,m)-uniform mixed hypergraph where l > 2 and m > 2.
    Reference: 1 T. Etzion and A. Hartman, Towards a large set of Steiner auaadruple systems, SIAM J. Discrete Math.4.(1991),182-195.
    2 T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin, D. West. The Chromatic Spectrum of Mixed Hypergraphs..Graphs and Combinatorics, 18(2002), 309-318.
    3 H. Lefmann, V. Rodl, and R. Thomas, Monochromatic vs. multicolored paths, Graphs Combin.8.(1992), 323-332.
    4 D. Lozovanu and V. Voloshin, Integer programming and mixed hypergraphs,(in preparation).
    5 L. Milazzo, On upper chromatic number for SQS(10) and SQS(16), Le MathematicheL(Catania, 1995), 179-193.
    6 L. Milazzo, The monochromatic block number, Discrete Math. 165-166 (1997), 487-496
    7 L. Milazzo and Zs. Tuza, Upper chromatic number of Steiner triple and quadruple systems, Discrete Math. 174(1997),247-259.
    8 L. Milazzo and Zs. Tuza, Strict colorings for classes of Steiner triple systems, Discrete Math.182(1998),233-243.
    9 Zs. Tuza and V. Voloshin, Uncolorable mixed hypergraphs, Distrete Applied Math.,(to appear)
    10 V.Vplosin, Mixed hypergraphs as models for real problems(in preparation).
    11 V. Voloshin, On the upper chromatic number of a hypergraph, Australasian J. Comb. 11(1995), 25-45.
    Description: 碩士
    國立政治大學
    應用數學研究所
    90751009
    91
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0090751009
    Data Type: thesis
    Appears in Collections:[應用數學系] 學位論文

    Files in This Item:

    File Description SizeFormat
    75100901.pdf68KbAdobe PDF21049View/Open
    75100902.pdf76KbAdobe PDF21051View/Open
    75100903.pdf64KbAdobe PDF21015View/Open
    75100904.pdf583KbAdobe PDF21261View/Open
    75100905.pdf46KbAdobe PDF21134View/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