Combinatorial vs. algebraic characterizations of completely pseudo-regular codes

zbMath1193.05110MaRDI QIDQ2380471

M. Cámara, J. Fàbrega, E. Garriga, Miquel Àngel Fiol

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/227868

zbMATH Keywords

adjacency matrixalgebraic approachC spectrumpseudodistance-regularity

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph designs and isomorphic decomposition (05C51)

Related Items (1)

On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes

This page was built for publication: Combinatorial vs. algebraic characterizations of completely pseudo-regular codes