On the computation of Seidel Laplacian eigenvalues for graph-based binary codes

DOI10.1016/j.disc.2024.113986zbMATH Open1539.05084MaRDI QIDQ6542019

Sihem Mesnager, Rameez Raja, Samir Ahmad Wagay

Publication date: 21 May 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

zero-divisor graphSeidel eigenvaluesbinary generating codeSeidel Laplacian eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Theory of error-correcting codes and error-detecting codes (94B99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Seidel integral complete multipartite graphs
• Coloring of commutative rings
• Eigenvalues of nonnegative symmetric matrices
• The zero-divisor graph of a commutative ring
• Degree maximal graphs are Laplacian integral
• Algorithmic graph theory and perfect graphs
• Threshold graphs and related topics
• Spectra of graphs obtained by a generalization of the join graph operation
• Seidel spectrum of threshold graphs
• Laplacian eigenvalues of the zero divisor graph of the ring \(\mathbb{Z}_n\)
• Synchronization Problems Solvable by Generalized PV Systems
• A survey on integral graphs

This page was built for publication: On the computation of Seidel Laplacian eigenvalues for graph-based binary codes