NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.084 seconds)

Spelling suggestions: "subject:"restricted edge connectivity"" "subject:"restricted edge nonnectivity""

1

關於邊連通數和邊度數的問題 / Some topics on edge connectivity and edge degrees

陳玫芳 Unknown Date (has links)
在這篇論文中，我們根據局部連通和局部補連通性質將圖分類，計算在 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.
局部連通圖
邊切集
限制邊連通數
Locally Connected Graphs
Edge Cuts
Restricted Edge Connectivity

Page generated in 0.0874 seconds