F-Labs/Spark-X2.5-4B-Hadamard-GSQ
Text Generation • 3B • Updated • 513 • 2
For a ring R, the zero-divisor graph is a simple graph Γ(R) whose vertex set is the set of all non-zero zero-divisors in a ring R, and two distinct vertices x and y are adjacent if and only if xy=0 or yx=0 in R. By using Weyl's inequality we give bounds on eigenvalues of adjacency matrix of Γ(M_2(F)), where M_2(F) is a 2 times 2 matrix ring over a finite field F.
Get this paper in your agent:
hf papers read 2312.09934 curl -LsSf https://hf.co/cli/install.sh | bash No dataset linking this paper
No Collection including this paper