政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/51471
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 112878/143845 (78%)
造访人次 : 50005260      在线人数 : 632
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    政大機構典藏 > 理學院 > 應用數學系 > 學位論文 >  Item 140.119/51471


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/51471


    题名: 關於邊連通數和邊度數的問題
    Some topics on edge connectivity and edge degrees
    作者: 陳玫芳
    贡献者: 張宜武
    陳玫芳
    关键词: 局部連通圖
    邊切集
    限制邊連通數
    Locally Connected Graphs
    Edge Cuts
    Restricted Edge Connectivity
    日期: 2010
    上传时间: 2011-10-05 16:18:31 (UTC+8)
    摘要: 在這篇論文中,我們根據局部連通和局部補連通性質將圖分類,計算在 Harary 圖裡大小為 2k - 1 和 2k 邊切集的個數,和證明當圖形有最大的最小邊度數和最小點度數差,一些關於度數為 1 的點個數性質。
    In this thesis, we classify some graphs into locally coconnected graphs or locally connected graphs, compute the number of its edge cuts of size 2k - 1 and 2k in a Harary graph, and show some properties of the number of vertices of degree 1 when the graph has the maximum difference of minimum edge degree and minimum vertex degree.
    參考文獻: [1] A.-H. Esfahanian and S. L. Hakimi, On computing a conditional edge-connectivity of a graph, Information Processing Letters, 27 (1988), pp. 195-199.
    [2] O. Jianping and F. Zhang, Super restricted edge connectivity of regular graphs, Graphs and Combinatorics, 21 (2005), pp. 459-467.
    [3] E. G. Kohler, Graphs Without Asteroidal Triples, PhD thesis, Technischen Universitat Berlin, 1999.
    [4] D. B. West, Introduction to Graph Theory, Prentice Hall, 2001.
    [5] J.-M. Xu and K.-L. Xu, On restricted edge-connectivity of graph, Discrete Mathematics, 243 (2002), pp. 291-298.
    描述: 碩士
    國立政治大學
    應用數學研究所
    98751004
    99
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0098751004
    数据类型: thesis
    显示于类别:[應用數學系] 學位論文

    文件中的档案:

    档案 大小格式浏览次数
    100401.pdf1535KbAdobe PDF21086检视/开启


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


    社群 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 ©   - 回馈