English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52047/87178 (60%)
Visitors : 8703187      Online Users : 79
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/94013

    Title: C4飽和圖的探討
    Other Titles: Study of C4 saturated graph
    Authors: 洪明岳;Hung, Ming-Yueh
    Contributors: 淡江大學中等學校教師在職進修數學教學碩士學位班
    Keywords: 完全圖;完全多分圖;C4飽和圖;complete graph;complete multipartite graph;C4 saturated graph
    Date: 2013
    Issue Date: 2014-01-23 13:47:37 (UTC+8)
    Abstract: 假設圖G 並不包含子圖C4,若在圖G 中任意不相鄰的兩點增加一邊後,就
    會包含有子圖C4,那我們就稱圖G 為C4 飽和圖。令sat(n,C4)和ex(n,C4)分別代
    表所有n 點C4 飽和圖中的邊數最小值與最大值。
    在這篇論文中找到含有n 點C4 飽和圖的一種建構法,並給予含有n 點C4
    飽和圖最少邊的一種建構法。再利用當n<=11 時C4 飽和圖的邊數之上、下界,
    建構出其邊數介於sat(n,C4)和ex(n,C4)之間的n 點C4 飽和圖。接著應用圖的鄰接矩陣及C4 飽和圖的性質,利用Maple 判斷所產生的圖是否為C4 飽和圖。
    我們定義了在完全多分圖中的C4 飽和圖,並探討完全多分圖Kn(m)的C4 飽

    1. sat(Kn,m, C4) <= m + n - 1,其中sat(Kn,m, C4) = min {│E(G)│: 圖G 為Kn,m 中C4 飽和圖}。
    2. sat(Kn(m), C4) <= mn – 1 + ┌(n-2)/2┐*m, 其中sat(Kn(m), C4) = min {│E(G)│: 圖 G 為Kn(m) 中C4 飽和圖},┌x┐為大於等於x 的最小整數值。
    Let G be a graph. If there is no 4-cycle contained in G and connecting any non
    adjacent vertices of G will obtain a 4-cycle, then we call G is a C4 saturated graph.
    Let sat(n, C4) and ex(n, C4) be the minimum and maximum number of edges of all C4
    saturated graphs with n vertices, respectively.
    In this thesis, we obtain a construction of C4 saturated graph with n points, and
    give another construction of C4 saturated graph with minimum edge. For n <= 11, we give a C4 saturated graph with n vertices and q edges, for each q between sat(n, C4)
    and ex(n, C4). After that, we use Maple to check whether the graph is a C4 saturated graph by using the adjacency matrix of a graph and the properties of C4 saturated graphs.
    We define a C4 saturated graph in a complete multipartite graph Kn (m) and obtain the following results:

    1. sat(Kn,m, C4) <= m + n - 1; and
    2. sat(Kn(m), C4) <= mn – 1 + ┌(n-2)/2┐*m, where sat(K, C4) = min {|E(G)|: G is a C4 saturated graph in the graph K} and ┌x┐ is the smallest integer greater than x .
    DOI: 10.6846%2fTKU.2013.00406
    Appears in Collections:[數學學系暨研究所] 學位論文

    Files in This Item:

    File Description 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