Covering Graphs with Directed Paths
碩士 === 國立交通大學 === 應用數學系所 === 97 === In this thesis we study an oriented version of perfect path double cover (PPDC). An oriented perfect path double cover (OPPDC) of a graph G is a collection of oriented paths in the symmetric orientation S(G) of G such that each edge of S(G) lies in exactly one of...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/98529606536829265565 |
id |
ndltd-TW-097NCTU5507030 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-097NCTU55070302015-10-13T15:42:32Z http://ndltd.ncl.edu.tw/handle/98529606536829265565 Covering Graphs with Directed Paths 圖的有向路徑覆蓋 Hsieh, Chi-Tsung 謝奇璁 碩士 國立交通大學 應用數學系所 97 In this thesis we study an oriented version of perfect path double cover (PPDC). An oriented perfect path double cover (OPPDC) of a graph G is a collection of oriented paths in the symmetric orientation S(G) of G such that each edge of S(G) lies in exactly one of the paths and for each vertex v ∈ V (G) there is a unique path which begins in v (and thus the same holds also for terminal vertices of the paths). First we show that if G has no components which isomorphism to K3 and G is a 3-degenerate graph, then G has an OPPDC. Next we also construct an OPPDC for complete bipartite graph Kn,n and multipartite graph Km(n) (n is odd and m ≠ 3, 5),respectively. Fu, Hung-Lin 傅恆霖 2009 學位論文 ; thesis 20 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 應用數學系所 === 97 === In this thesis we study an oriented version of perfect path double cover (PPDC). An oriented perfect path double cover (OPPDC) of a graph G is a collection of oriented paths in the symmetric orientation S(G) of G such that each edge of
S(G) lies in exactly one of the paths and for each vertex v ∈ V (G) there is a unique path which begins in v (and thus the same holds also for terminal vertices of the paths). First we show that if G has no components which isomorphism to K3 and G is a 3-degenerate graph, then G has an OPPDC. Next we also construct an OPPDC for complete bipartite graph Kn,n and multipartite graph Km(n) (n is odd and m ≠ 3, 5),respectively.
|
author2 |
Fu, Hung-Lin |
author_facet |
Fu, Hung-Lin Hsieh, Chi-Tsung 謝奇璁 |
author |
Hsieh, Chi-Tsung 謝奇璁 |
spellingShingle |
Hsieh, Chi-Tsung 謝奇璁 Covering Graphs with Directed Paths |
author_sort |
Hsieh, Chi-Tsung |
title |
Covering Graphs with Directed Paths |
title_short |
Covering Graphs with Directed Paths |
title_full |
Covering Graphs with Directed Paths |
title_fullStr |
Covering Graphs with Directed Paths |
title_full_unstemmed |
Covering Graphs with Directed Paths |
title_sort |
covering graphs with directed paths |
publishDate |
2009 |
url |
http://ndltd.ncl.edu.tw/handle/98529606536829265565 |
work_keys_str_mv |
AT hsiehchitsung coveringgraphswithdirectedpaths AT xièqícōng coveringgraphswithdirectedpaths AT hsiehchitsung túdeyǒuxiànglùjìngfùgài AT xièqícōng túdeyǒuxiànglùjìngfùgài |
_version_ |
1717768389988974592 |