Linear ternary codes of strongly regular signed graphs
From MaRDI portal
Publication:6080192
DOI10.1016/j.disc.2023.113714OpenAlexW4387418393MaRDI QIDQ6080192
Publication date: 30 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113714
Linear codes (general theory) (94B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-signed graphs with smallest eigenvalue greater than \(-2\)
- Regular graphs. A spectral approach
- Distance regular graphs of diameter 3 and strongly regular graphs
- Signed graphs represented by \(D_{\infty}\)
- Line graphs, root systems, and elliptic geometry
- Classification of binary/ternary one-error-correcting codes
- New lower bounds on error-correcting ternary, quaternary and quinary codes
- Error-correcting codes from graphs
- Binary codes of strongly regular graphs
- On strongly regular signed graphs
- Spectra of signed graphs with two eigenvalues
- Linear codes over signed graphs
- On signed graphs with just two distinct adjacency eigenvalues
- Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2\)]
- Matrices in the Theory of Signed Simple Graphs
- A Coding Approach to Signed Graphs
- Bounds on mixed binary/ternary codes
- Notes on exceptional signed graphs
- Total graph of a signed graph
- Signed graphs with two eigenvalues and vertex degree five
- Signed graphs with totally disconnected star complements
- A Bound for Error-Correcting Codes
- On a class of strongly regular signed graphs
- A decomposition of signed graphs with two eigenvalues
- On cospectral oriented graphs and cospectral signed graphs
This page was built for publication: Linear ternary codes of strongly regular signed graphs
