淡江大學機構典藏:Item 987654321/55463
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62805/95882 (66%)
造访人次 : 3930375      在线人数 : 756
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/55463


    题名: Construction of graphs with given circular flow number
    作者: Pan, Zhi-shi
    贡献者: 淡江大學數學學系
    关键词: graph;flow;circular flow number;rooted-flow;series join;parallel join;two-terminal graph
    日期: 2003-07-07
    上传时间: 2011-08-22 16:09:00 (UTC+8)
    出版者: Hoboken: John Wiley & Sons, Inc.
    摘要: Suppose r ≥ 2 is a real number. A proper r-flow of a directed multi-graph G=(V,E) is a mapping f:E→R such that (i) for every edge e ∈ E ,1 ≤|f(e)| ≤r-1; (ii) for every vertex v ∈V,Σe ∈ E +(v)f(e) =0. The circular flow number of a graph G is the least r for which an orientation of G admits a proper r-flow. The well-known 5-flow conjecture is equivalent to the statement that every bridgeless graph has circular flow number at most 5. In this paper, we prove that for any rational number r between 2 and 5, there exists a graph G with circular flow number r.
    關聯: Journal of Graph Theory 43(4),　p.304-318
    DOI: 10.1002/jgt.10124
    显示于类别:[數學學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    04 Construction for flow.pdf158KbAdobe PDF496检视/开启
    Construction of graphs with given circular flow number.pdf158KbAdobe PDF1检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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