Abstract
We consider the class of symmetric -matrices with zero trace and constant row sums k which can be identified with the class of the adjacency matrices of k-regular undirected graphs. In a previous paper, two partial orders, the Bruhat and the Bruhat-graph order, have been introduced in this class. In fact, when k = 1 or k = 2, it was shown that the two orders coincide, while for the two orders are distinct. In this paper we give general properties of minimal and maximal matrices for these orders on and study the minimal and maximal matrices when k = 1, 2 or 3.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
