scientific article
From MaRDI portal
Publication:3113174
zbMATH Open1231.05303MaRDI QIDQ3113174FDOQ3113174
Publication date: 8 February 2012
Title of this publication is not available (Why is that?)
distanceadjacency matrixsecond largest eigenvalueJohnson graphBooleam latticelinear regular partitionregular linear partitionstriangle based vectors
Cited In (9)
- Completely regular designs of strength one
- Boolean degree 1 functions on some classical association schemes
- Tight distance-regular graphs with respect to subsets
- Degree 2 Boolean functions on Grassmann graphs
- Width and dual width of subsets in polynomial association schemes
- Equivalent definitions for (degree one) Cameron-Liebler classes of generators in finite classical polar spaces
- Neighbour-transitive codes in Johnson graphs
- The classification of Boolean degree \(1\) functions in high-dimensional finite vector spaces
- Sporadic neighbour-transitive codes in Johnson graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113174)
