标题: t-装填与t-覆盖
A study of t-packing and t-covering
作者: 陈冠帆
Guan-Fan Chen
傅恒霖
Hung-Lin Fu
应用数学系所
关键字: 装填;装填;t-packing;t-covering;packing;covering
公开日期: 2002
摘要: 一个图 的t-装填是一族G的子图H1,H2,...,Ht;任两个图同构而且没有共同边,同时每个图的边数恰为[|E(G)|/t]。一个图G的t-覆盖是一族彼此同构的t个图H1,H2,...,Ht其中每个图的边数为[|E(G)|/t]+1而且G中所有边包含在所有H的边的联集中。
在这一篇论文中,我们研究t-装填(或t-覆盖)中所产生的剩余图(增加图)。对于所有t不大于6,我们把完全图的所有可能在 -装填(或 -覆盖)所产生的剩余图(增加图)全部找出来。
A t-packing of a graph G is a collection of t edge-disjoint isomorphic subgraphs of G such that each subgraph is of size
[|E(G)|/t]. A t-covering of a graph G is a collection of t edge-disjoint isomorphic graphs H1,H2,...,Ht such that all edges of G contians in all union of edges of H's.
In this thesis, we study the remainder graph (respectively, surplus graph) of each t-packing (respectively, t-covering) of the complete graph. For t is small than six, we determine
all possible remainder graphs and respectively surplus graphs.
URI: http://140.113.39.130/cdrfb3/record/nctu/#NT910507003
http://hdl.handle.net/11536/70936
显示于类别:Thesis