Covering Graphs

dc.contributor.author吳森原zh_tw
dc.date.accessioned2014-10-27T15:25:14Z
dc.date.available2014-10-27T15:25:14Z
dc.date.issued1978-06-??zh_TW
dc.description.abstract本文中我們首先定義覆蓋圖形,然後利用其性質證明可以找到無限多個線遞移,或t-遞移或局部t-遞移圖形。zh_tw
dc.description.abstractN. Biggs [1] proved that if G is a t-transitive graph, then there exists a covering graph which is also t-transitive. In this paper, we extend this result to local t-transitivity and to edge-transitivity.Let G be a graph, the group of graph-automorphism of G will be denoted by aut(G).V(G) and E(G) denote the sets of vertices and edges of G, respectively. In this paper, we assume that G is simple, that is, G has no Multiple edges and no loops.en_US
dc.identifier9C7BD4AC-D3E9-E5F0-DD02-C4092E2E81D7zh_TW
dc.identifier.urihttp://rportal.lib.ntnu.edu.tw/handle/20.500.12235/17471
dc.language英文zh_TW
dc.publisher國立臺灣師範大學研究發展處zh_tw
dc.publisherOffice of Research and Developmenten_US
dc.relation(23),270-266zh_TW
dc.relation.ispartof師大學報zh_tw
dc.subject.other覆蓋圖形zh_tw
dc.titleCovering Graphszh-tw
dc.title.alternative覆蓋圖形zh_tw

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
ntnulib_ja_L0801_0023_270.pdf
Size:
159.54 KB
Format:
Adobe Portable Document Format

Collections