Abstract

We consider the problem of determining the minimum and maximum of the sum of the elements of the square of a matrix for the following classes of matrices:the (0, l)-matrices of order n with a specified number of l's; the symmetric (0,1)-matrices of order n with zero trace and with a specified number of l's above the main diagonal (adjacency matrices of graphs with a specified number of edges); and the subset of the latter consisting of adjacency matrices of connected graphs.

Full Text
Paper version not known

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 call

Disclaimer: 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.