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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
