L_ norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs
From MaRDI portal
Publication:6587448
Recommendations
Cites work
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- Boolean degree 1 functions on some classical association schemes
- Cameron-Liebler \(k\)-sets in \(\text{AG}(n,q)\)
- Completely regular codes in Johnson and Grassmann graphs with small covering radii
- Embedding of eigenfunctions of the Johnson graph into eigenfunctions of the Hamming graph
- Existence of \(q\)-analogs of Steiner systems
- Induced perfect colorings
- Nowhere-zero eigenvectors of graphs
- On completely regular codes with minimum eigenvalue in geometric graphs
- On the number of inequivalent steiner triple systems
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- Ranks of incidence matrices of Steiner triple systems
- Steiner triple systems and strongly regular graphs
- Tactical decompositions and orbits of projective groups
- The complete enumeration of triad systems in 15 elements.
- Zero-sum flows for Steiner systems
- Zero-sum flows for triple systems
- Zero-sum flows in designs
- Zero-sum flows of the linear lattice.
This page was built for publication: \(L_{\infty}\) norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587448)