Affiliation:
1. Center for Advanced Study, Department of Mathematics, Savitribai Phule Pune University, Pune 411007, India
Abstract
In this paper, we study the non-commuting graph [Formula: see text] of strictly upper triangular [Formula: see text] matrices over an [Formula: see text]-element chain [Formula: see text]. We prove that [Formula: see text] is a compact graph. From [Formula: see text], we construct a poset [Formula: see text]. We further prove that [Formula: see text] is a dismantlable lattice and its zero-divisor graph is isomorphic to [Formula: see text]. Lastly, we prove that [Formula: see text] is a perfect graph.
Funder
University Grant Commission, New Delhi
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Reference13 articles.
1. On a class of finite lattices
2. C. Berge, “Perfect graphs”: Six Papers on Graph Theory (Indian Statistical Institute, Calcutta, 1963), pp. 1–21.
3. The strong perfect graph theorem
4. Zero Divisor Graph of a Poset with Respect to an Ideal