چكيده به لاتين
In this thesis, we introduce completely regular codes and equitable partitions. The concept of completely regular codes and equitable partitions was proposed by Phillipe Delsarte in 1973. Completely regular codes have interesting combinatorial properties that one of them is that each perfect code is a completely regular code. To prove his claim, Delsarte defined these codes. He claimed that there are no perfect codes in Johnson graphs that time.
In this thesis, in addition to introducing equitable partition, we obtain some results about them. In fact, we enumerate all parameter matrices in generalized petersen graphs, platonic graphs, cubical graph and petersen graph. Also, more results are obtained for more graphs.
