L_ norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs
From MaRDI portal
Publication:6587448
DOI10.33048/SEMI.2023.20.070zbMATH Open1543.05012MaRDI QIDQ6587448FDOQ6587448
Authors: Evgeniĭ Andreevich Bespalov, Ivan Yu. Mogilnykh, Konstantin Vorob'ev 
Publication date: 14 August 2024
Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Flows in graphs (05C21) Triple systems (05B07)
Cites Work
- A Contribution to the Theory of Chromatic Polynomials
- Tactical decompositions and orbits of projective groups
- On the number of inequivalent steiner triple systems
- Title not available (Why is that?)
- Existence of \(q\)-analogs of Steiner systems
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- Ranks of incidence matrices of Steiner triple systems
- Zero-sum flows for Steiner systems
- Zero-sum flows in designs
- Zero-sum flows of the linear lattice.
- Nowhere-zero eigenvectors of graphs
- Zero-sum flows for triple systems
- Induced perfect colorings
- Boolean degree 1 functions on some classical association schemes
- The complete enumeration of triad systems in 15 elements.
- Cameron-Liebler \(k\)-sets in \(\text{AG}(n,q)\)
- On completely regular codes with minimum eigenvalue in geometric graphs
- 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
- Steiner triple systems and strongly regular graphs
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)
