We focus on a class of highly symmetric graphs enjoying what we call distanceregularity, to which the method of quantum decomposition is applied quite efficiently. This chapter is devoted to developing the general theory while concrete examples will be discussed in the following chapters.
KeywordsCoherent State Adjacency Matrix Spectral Distribution Intersection Number Association Scheme
Unable to display preview. Download preview PDF.