الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 170 |  |  |
| | | from | 170 | | |
Abstract
In this thesis we investigate and study a class of highly regular graph decom-position .Graph decomposition have been studied science the19th century. Their investigation is originated by various combinatorial problems, the best known among them are kirkman`s problems of 15 strolling schoolgirls and Euler`s problems of 36 army offices . Many combinatorial and algebraic structures are linked to these objects . For an overview of the subject , The reader may refer to the book of Bosak. The vast results in this area are summarized in the CRC Handbook of combinatorial design.