On the independence number of regular graphs of matrix rings

dc.contributor.authorNica, Bogdan
dc.contributor.departmentMathematical Sciences, School of Science
dc.date.accessioned2025-03-28T19:57:16Z
dc.date.available2025-03-28T19:57:16Z
dc.date.issued2024-01
dc.description.abstractConsider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a consequence, we obtain a lower bound for its chromatic number that significantly improves a previous result of Tomon.
dc.eprint.versionAuthor's manuscript
dc.identifier.citationNica, B. (2024). On the independence number of regular graphs of matrix rings. Linear Algebra and Its Applications, 681, 89–96. https://doi.org/10.1016/j.laa.2023.10.021
dc.identifier.urihttps://hdl.handle.net/1805/46660
dc.language.isoen
dc.publisherElsevier
dc.relation.isversionof10.1016/j.laa.2023.10.021
dc.relation.journalLinear Algebra and Its Applications
dc.rightsAttribution 4.0 Internationalen
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.sourceArXiv
dc.subjectmatrix rings
dc.subjectregular graphs
dc.subjectindependence number
dc.titleOn the independence number of regular graphs of matrix rings
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Nica2024OntheIndependence-CCBY.pdf
Size:
157.06 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.04 KB
Format:
Item-specific license agreed upon to submission
Description: