| Summary: | 碩士 === 國立交通大學 === 應用數學系 === 91 === 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.
|
|---|
