\(L_{\infty}\) norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs

DOI10.33048/semi.2023.20.070zbMath1543.05012MaRDI QIDQ6587448

Evgeniĭ Andreevich Bespalov, Ivan Yu. Mogilnykh, Konstantin Vorob'ev

Publication date: 14 August 2024

Published in: Unnamed Author (Search for Journal in Brave)

zbMATH Keywords

eigenvalueJohnson graphstrongly regular graphSteiner triple systemflowGrassmann graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Triple systems (05B07) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Zero-sum flows of the linear lattice.
• Zero-sum flows for triple systems
• Induced perfect colorings
• Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
• Ranks of incidence matrices of Steiner triple systems
• The complete enumeration of triad systems in 15 elements.
• Boolean degree 1 functions on some classical association schemes
• Tactical decompositions and orbits of projective groups
• Completely regular codes in Johnson and Grassmann graphs with small covering radii
• Zero-sum flows for Steiner systems
• Cameron-Liebler \(k\)-sets in \(\text{AG}(n,q)\)
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• Zero-sum flows in designs
• Nowhere-zero eigenvectors of graphs
• Embedding of eigenfunctions of the Johnson graph into eigenfunctions of the Hamming graph
• On the number of inequivalent steiner triple systems
• Steiner triple systems and strongly regular graphs
• A Contribution to the Theory of Chromatic Polynomials
• On completely regular codes with minimum eigenvalue in geometric 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