Moore-Penrose Inverses of the Signless Laplacian and Edge-Laplacian of Graphs

Authors

Ryan Hassert
Sudipta Mallik, Marshall UniversityFollow

Document Type

Article

Publication Date

8-2021

Abstract

The signless Laplacian Q and signless edge-Laplacian S of a given graph may or may not be invertible. The Moore-Penrose inverses of Q and S are studied. In particular, using the incidence matrix, we find combinatorial formulas of the Moore-Penrose inverses of Q and S for trees. Also, we present combinatorial formulas of the inverses of Q and S for odd unicyclic graphs.

Comments

© 2021 Elsevier. All rights reserved.

Recommended Citation

Hessert, R., & Mallik, S. (2021). Moore-Penrose inverses of the signless Laplacian and edge-Laplacian of graphs. Discrete Mathematics, 344(8), 112451.