Abstract
Two natural linear models associated with a graph are considered. The Gauss–Markov theorem is used in one of the models to derive a combinatorial formula for the Moore–Penrose inverse of the incidence matrix of a tree. An inequality involving the Moore–Penrose inverse of the Laplacian matrix of a graph and its distance matrix is obtained. The case of equality is discussed. Again the main tool used in the proof is the theory of linear estimation.
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.
