English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49432/84396 (59%)
Visitors : 7457951      Online Users : 67
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/101591

    Title: 史納克圖形的有向圈雙重覆蓋及圓流數
    Other Titles: Oriented circuit double cover and circular flow number of flower snark
    Authors: 王志維;Wang, Zhi-Wei
    Contributors: 淡江大學數學學系碩士班
    潘志實;Pan, Zhi-Shi
    Keywords: ;史納克;圈雙重覆蓋;色數;circuit;snark;circuit double cover;colouring
    Date: 2014
    Issue Date: 2015-05-01 16:11:14 (UTC+8)
    Abstract: C是G中的有向圈所形成的集合,其中C是G的有向圈雙重覆蓋,我們將
    令J_(2k+1)是一個史納克圖形,頂點集合V(J_(2k+1) )={a_i,b_i,c_i,d_i:i=0,1,…,2k}
    邊集合E(J_(2k+1) )={b_i a_i,b_i c_i,b_i d_i,a_i a_(i+1),c_i d_(i+1),d_i c_(i+1):i=0,1,…,2k},其中每一個索引要模2k+1。
    (1)If k≥1, then χ_c(I_C )≥5.
    For a set C of directed crcuits of a graph G that form an oriented circuit double cover,we denote by I_C the graph with vertex set C,in which two circuits C and C'' are connected by k edges if |C∩C''|=k.
    Let ϕ^*_c (G)=min{χ_c(I_C)},where the minimum is taken over all the oriented circuit double covers of G,it is easy to show that for any graph G,ϕ_c(G)<ϕ^*_c (G).
    We also show that there are graphs G for which ϕ_c (G)<ϕ^*_c (G).
    Let J_(2k+1) be the flower snark which has vertex set V(J_(2k+1) )={a_i,b_i,c_i,d_i:i=0,1,…,2k}
    and dege set E(J_(2k+1) )={b_i a_i,b_i c_i,b_i d_i,a_i a_(i+1),c_i d_(i+1),d_i c_(i+1):i=0,1,…,2k},where the summationin indices are modulo 2k+1.
    In this thesis,we proved that
    (1)If k≥1, then 〖 χ〗_c (I_C )≥5.
    Appears in Collections:[數學學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback