| Summary: | 碩士 === 嶺東科技大學 === 資訊科技應用研究所 === 101 === Graph packing and covering, graph decomposition included, has been and continues to be a popular topic of research in graph theory, and its results can be applied in coding theory, synchronous optical networks (SONET) and other fields.
In this thesis, we obtain necessary and sufficient conditions for the existence of a (G,H)-multidecomposition problem of the balanced complete bipartite graph where G and H are a k-path, a k-star or a k-cycle. Moreover, we consider the multipackings and multicoverings of balanced complete bipartite graph with pairs of small G and H, and give the complete solutions to the maximum multipacking and minimum multicovering problems.
|
|---|
