40,348 research outputs found

    Distance-regular graphs

    Get PDF
    This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page

    Families of nested completely regular codes and distance-regular graphs

    Get PDF
    In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius ρ\rho equal to 33 or 44, and are 1/2i1/2^i-th parts, for i{1,,u}i\in\{1,\ldots,u\} of binary (respectively, extended binary) Hamming codes of length n=2m1n=2^m-1 (respectively, 2m2^m), where m=2um=2u. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter DD equal to 33 or 44 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive

    Commutative association schemes

    Full text link
    Association schemes were originally introduced by Bose and his co-workers in the design of statistical experiments. Since that point of inception, the concept has proved useful in the study of group actions, in algebraic graph theory, in algebraic coding theory, and in areas as far afield as knot theory and numerical integration. This branch of the theory, viewed in this collection of surveys as the "commutative case," has seen significant activity in the last few decades. The goal of the present survey is to discuss the most important new developments in several directions, including Gelfand pairs, cometric association schemes, Delsarte Theory, spin models and the semidefinite programming technique. The narrative follows a thread through this list of topics, this being the contrast between combinatorial symmetry and group-theoretic symmetry, culminating in Schrijver's SDP bound for binary codes (based on group actions) and its connection to the Terwilliger algebra (based on combinatorial symmetry). We propose this new role of the Terwilliger algebra in Delsarte Theory as a central topic for future work.Comment: 36 page
    corecore