Maximal Singly Connected Digraphs
碩士 === 國立臺北商業大學 === 資訊與決策科學研究所 === 104 === A directed graph G is singly connected if each pair of vertices is connected by at most one simple path, and maximal singly connected if no other singly connected directed graph with the same set of vertices contains the edges of G. In this thesis, we explo...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/ubd3vq |
| id |
ndltd-TW-104NTB05243017 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-104NTB052430172018-05-04T04:27:26Z http://ndltd.ncl.edu.tw/handle/ubd3vq Maximal Singly Connected Digraphs 最大單連通有向圖 Shao-Li Lu 呂紹立 碩士 國立臺北商業大學 資訊與決策科學研究所 104 A directed graph G is singly connected if each pair of vertices is connected by at most one simple path, and maximal singly connected if no other singly connected directed graph with the same set of vertices contains the edges of G. In this thesis, we explore the properties of a maximal singly connected directed graph and extend the concept to subgraphs of a directed graph. In particular, we give two classes of such subgraphs in unidirectional hypercubes. Jou-Ming Chang 張肇明 2016 學位論文 ; thesis 39 en_US |
| collection |
NDLTD |
| language |
en_US |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 國立臺北商業大學 === 資訊與決策科學研究所 === 104 === A directed graph G is singly connected if each pair of vertices is connected by at most one simple path, and maximal singly connected if no other singly connected directed graph with the same set of vertices contains the edges of G. In this thesis, we explore the properties of a maximal singly connected directed graph and extend the concept to subgraphs of a directed graph. In particular, we give two classes of such subgraphs in unidirectional hypercubes.
|
| author2 |
Jou-Ming Chang |
| author_facet |
Jou-Ming Chang Shao-Li Lu 呂紹立 |
| author |
Shao-Li Lu 呂紹立 |
| spellingShingle |
Shao-Li Lu 呂紹立 Maximal Singly Connected Digraphs |
| author_sort |
Shao-Li Lu |
| title |
Maximal Singly Connected Digraphs |
| title_short |
Maximal Singly Connected Digraphs |
| title_full |
Maximal Singly Connected Digraphs |
| title_fullStr |
Maximal Singly Connected Digraphs |
| title_full_unstemmed |
Maximal Singly Connected Digraphs |
| title_sort |
maximal singly connected digraphs |
| publishDate |
2016 |
| url |
http://ndltd.ncl.edu.tw/handle/ubd3vq |
| work_keys_str_mv |
AT shaolilu maximalsinglyconnecteddigraphs AT lǚshàolì maximalsinglyconnecteddigraphs AT shaolilu zuìdàdānliántōngyǒuxiàngtú AT lǚshàolì zuìdàdānliántōngyǒuxiàngtú |
| _version_ |
1718634439792132096 |