On the independence number of regular graphs of matrix rings
From MaRDI portal
Publication:6184915
DOI10.1016/j.laa.2023.10.021OpenAlexW4388163061MaRDI QIDQ6184915
Publication date: 29 January 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2023.10.021
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Gauss sums over some matrix groups
- The clique numbers of regular graphs of matrix algebras are finite
- Eigenvalue bounds for independent sets
- The total graph of a commutative ring
- Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes
- Character sums and abelian Ramanujan graphs (with an appendix by Keqin Feng and Wen-Ch'ing Winnie Li)
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- On the chromatic number of structured Cayley graphs
- A relative bound for independence
- On the chromatic number of regular graphs of matrix algebras
- Chromatic number and clique number of subgraphs of regular graph of matrix algebras
- Hoffman's ratio bound
- Diameters and Eigenvalues
- Graphs from Rings
- The Total Graphs of Finite Rings
This page was built for publication: On the independence number of regular graphs of matrix rings