On the computation of Seidel Laplacian eigenvalues for graph-based binary codes
From MaRDI portal
Recommendations
Cites work
- A survey on integral graphs
- Algorithmic graph theory and perfect graphs
- Coloring of commutative rings
- Degree maximal graphs are Laplacian integral
- Eigenvalues of nonnegative symmetric matrices
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- Laplacian eigenvalues of the zero divisor graph of the ring \(\mathbb{Z}_n\)
- On the Seidel integral complete multipartite graphs
- On the Seidel Laplacian and Seidel signless Laplacian polynomials of graphs
- Seidel spectrum of threshold graphs
- Spectra of graphs obtained by a generalization of the join graph operation
- Synchronization Problems Solvable by Generalized PV Systems
- The zero-divisor graph of a commutative ring
- Threshold graphs and related topics
This page was built for publication: On the computation of Seidel Laplacian eigenvalues for graph-based binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542019)