Abstract
The aim of this paper is to present a study of the Moore–Penrose inverse [Formula: see text] of the Laplacian matrix of a simple and connected graph, particularly, for some families of graphs such as path, cycle, ladder, fan and wheel graphs. For this purpose, it is used diverse approaches and MP inverse of the Cartesian product of graphs, and are obtained new closed-form formulas of the [Formula: see text] of these families. A comparison of the computational efficiency of the new formulas versus traditional mathematical software is presented, showing the advantage of new formulas.
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.
