Processing math: 100%
World Scientific
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.

Perfect non-commuting graphs of matrices over chains

    https://doi.org/10.1142/S1793830917500495Cited by:0 (Source: Crossref)

    In this paper, we study the non-commuting graph Γ(Msu3(Cn)) of strictly upper triangular 3×3 matrices over an n-element chain Cn. We prove that Γ(Msu3(Cn)) is a compact graph. From Γ(Msu3(Cn)), we construct a poset P. We further prove that P1 is a dismantlable lattice and its zero-divisor graph is isomorphic to Γ(Msu3(Cn)). Lastly, we prove that Γ(Msu3(Cn)) is a perfect graph.

    AMSC: Primary 05C15, Secondary 06A07