Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs

DOI10.17377/SEMI.2018.15.022zbMATH Open1394.05074MaRDI QIDQ1669902FDOQ1669902

Evgeniya Vadimovna Sotnikova

Publication date: 4 September 2018

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

eigenfunctionsdistance-regular graphscubical graphsminimum supports

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cites Work

• Eigenspaces of graphs
• Title not available (Why is that?)
• The Kronecker Product of Graphs
• Multiple Kronecker covering graphs
• On perfect 2-colorings of the \(q\)-ary \(n\)-cube
• Cubic Distance-Regular Graphs
• To the theory of \(q\)-ary Steiner and other-type trades
• Minimum supports of eigenfunctions of Hamming graphs
• Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
• Minimum supports of eigenfunctions of Johnson graphs

Cited In (6)

• Minimum supports of functions on the Hamming graphs with spectral constraints
• Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
• Optimal functions with spectral constraints in hypercubes
• Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph
• Minimum supports of eigenfunctions in bilinear forms graphs
• Minimum supports of eigenfunctions of graphs: a survey

This page was built for publication: Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1669902)