Linear ternary codes of strongly regular signed graphs
From MaRDI portal
Recommendations
Cites work
- A Bound for Error-Correcting Codes
- A Coding Approach to Signed Graphs
- A decomposition of signed graphs with two eigenvalues
- An introduction to the theory of graph spectra
- Binary codes of strongly regular graphs
- Bounds on mixed binary/ternary codes
- Classification of binary/ternary one-error-correcting codes
- Classification of regular two-graphs on 36 and 38 vertices
- Distance regular graphs of diameter 3 and strongly regular graphs
- Edge-signed graphs with smallest eigenvalue greater than \(-2\)
- Error-correcting codes from graphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 1209696 (Why is no real title available?)
- scientific article; zbMATH DE number 1250549 (Why is no real title available?)
- scientific article; zbMATH DE number 1504690 (Why is no real title available?)
- Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
- Line graphs, root systems, and elliptic geometry
- Linear codes over signed graphs
- Matrices in the theory of signed simple graphs
- New lower bounds on error-correcting ternary, quaternary and quinary codes
- Notes on exceptional signed graphs
- Notes on Johnson and Hamming signed graphs
- On a class of strongly regular signed graphs
- On cospectral oriented graphs and cospectral signed graphs
- On signed graphs with just two distinct adjacency eigenvalues
- On strongly regular signed graphs
- Regular graphs. A spectral approach
- Signed graphs represented by \(D_{\infty}\)
- Signed graphs with totally disconnected star complements
- Signed graphs with two eigenvalues and vertex degree five
- Spectra of signed graphs with two eigenvalues
- Total graph of a signed graph
This page was built for publication: Linear ternary codes of strongly regular signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080192)