Abstract
Abstract We analyze when the Moore–Penrose inverse of the combinatorial Laplacian of a distance–regular graph is an M–matrix and then we say that the graph has the M–property. We prove that only distance–regular graphs with diameter up to three can have the M–property and we give a characterization, in terms of their intersection array, of those distance–regular graphs that satisfy the M–property. It is remarkable that either a primitive strongly regular graph or its complement has the M–property.
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.
