Abstract
We present four different approaches to calculate the Moore–Penrose inverse of a Laplacian matrix of a connected threshold graph. The first one is combinatorial and it benefits from the combinatorial structure of a threshold graph, while the second three are of algebraic nature and explore the particular structure of a matrix in question.
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.
