We provide a relation between the Moore–Penrose inverse of the Laplacian and signless Laplacian matrices of a bipartite graph. As a consequence, we obtain combinatorial formulae for the Moore–Penrose inverse of signless Laplacians of bipartite graphs. We also provide a combinatorial formula for the Moore–Penrose inverse of an incidence matrix of any graph. In this way, we answer some of open problems raised in Hessert and Mallik (Discrete Math 344:112451, 2021).
机构:
Xinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R ChinaXinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R China
Niu, Aihong
Fan, Dandan
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R ChinaXinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R China
Fan, Dandan
Wang, Guoping
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R ChinaXinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R China