Processing math: 100%
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    Square element graph of square-subtract rings

    If R is a ring then the square element graph 𝕊q(R) is the simple undirected graph whose vertex set consists of all non-zero elements of R and two distinct vertices u,v are adjacent if and only if u+v=x2 for some xR{0}. In this paper, we provide some necessary and sufficient conditions for the connectedness of 𝕊q(R), where R is a ring with identity. We mainly characterize some special class of ring R which we call square-subtract ring for which the graph 𝕊q(Mn(R)) is connected.

  • articleNo Access

    Hamiltonian trace graph of matrices

    Let R be a commutative ring with identity, n2 be a positive integer and Mn(R) be the set of all n×n matrices over R. For a matrix AMn(R), Tr(A) is the trace of A. The trace graph of the matrix ring Mn(R), denoted by Γt(Mn(R)), is the simple undirected graph with vertex set {AMn(R):there exists BMn(R) such that Tr(AB)=0} and two distinct vertices A and B are adjacent if and only if Tr(AB)=0. The ideal-based trace graph of the matrix ring Mn(R) with respect to an ideal I of R, denoted by ΓIt(Mn(R)), is the simple undirected graph with vertex set Mn(R)Mn(I) and two distinct vertices A and B are adjacent if and only if Tr(AB)I. In this paper, we investigate some properties and structure of ΓIt(Mn(R)). Further, it is proved that both Γt(Mn(R)) and ΓIt(Mn(R)) are Hamiltonian.