Report - -point counts in distance-regular graphsneum/ms/Bled2019.pdf · We consider distance regular graphs of diameter d = d with v vertices and intersection array i() = fb 0;:::;b d 1;

Please pass captcha verification before submit form