| Summary: | 博士 === 國立中央大學 === 數學系 === 103 === In this thesis, we investigate decompositions and antimagic labelings of graphs.
In Chapter 1, we give some terminology and notation needed in the thesis. Chapter
2∼4 concern decompositions of graphs. Chapter 5 concerns antimagic labelings of
graphs.
In Chapter 2, we consider the problems about decompositions of the complete graphs
Kn into two kinds of graphs, each with specific numbers of edges.
In Chapter 3, the problems of the maximum (Pk; Sk)-packing, the minimum (Pk; Sk)-
covering, the maximum (Ck; Sk)-packing and the minimum (Ck; Sk)-covering of Kn
are investigated.
In Chapter 4, we give necessary and sufficient conditions for the spiders to be t-
decomposable.
In Chapter 5, we obtain a necessary condition for the star forest to be antimagic and
a sufficient condition for the star forest to be antimagic, and necessary and sufficient
conditions for mS2 ∪ Sn to be antimagic.
|
|---|
