الفهرس 
coverOnly 14 pages are availabe for public view
 |  | from | 56 |  |  |
| | | from | 56 | | |
Abstract
This thesis consists of three chapters.
Chapter zero:
In chapter zero we introduce some basic definitions and theorems in graph theory and Number theory which we need afterwards.
Chapter one:
In chapter one, we study: combination, permutation, strong kcombination
and strong k- permutation graphs. We introduce
some necessary conditions for a graph to be: a combination graph, a permutation graph, a strong k-combination graph and a strong k-permutation graph. We determine all maximal
strong k-combination graphs of order ≤ 6 .
Chapter two:
In chapter two, We study: combination and permutation graphs. We introduce some families to be: combination graphs and permutation graphs. The results of Chapter 1will appear in the international journal Utilita Mathematica and The results of Chapter 2 will appear in the international journal Ars Combinatoria.