On the connectivity of the complement of a graph
碩士 === 國立臺灣科技大學 === 資訊管理系 === 91 === In this thesis, we discuss the connectivity relasionship between an undirected simple graph and its complement graph. At first, we present a simple method to compute the connectivity of a graph that comes from joining multiple graphs. Then, we give the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/95736650972669438967 |
| Summary: | 碩士 === 國立臺灣科技大學 === 資訊管理系 === 91 === In this thesis, we discuss the connectivity relasionship between an undirected simple graph and its complement graph. At first, we present a simple method to compute the connectivity of a graph that comes from joining multiple graphs. Then, we give the bounds to the connectivity of the complement graph of a given graph. Finally, we correct the proof of the theorem proposed by Wawarabayshi et al. In addition, we improve their result.
|
|---|