An analog of matrix tree theorem for signless Laplacians

DOI10.1016/j.laa.2018.09.016zbMath1402.05139arXiv1805.04759OpenAlexW2963391230MaRDI QIDQ1625479

Sudipta Mallik, Keivan Hassani Monfared

Publication date: 29 November 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.04759

zbMATH Keywords

grapheigenvalueminorspanning treesignless Laplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

Moore-Penrose inverse of the signless Laplacians of bipartite graphs ⋮ The inverse of the incidence matrix of a unicyclic graph ⋮ On maximum signless Laplacian Estrada indices of \(k\)-trees ⋮ Moore-Penrose inverses of the signless Laplacian and edge-Laplacian of graphs ⋮ Matrix-tree theorem of digraphs via signless Laplacians

Cites Work

• Spectra of graphs
• Signless Laplacians of finite graphs
• Some results on the signless Laplacians of graphs

This page was built for publication: An analog of matrix tree theorem for signless Laplacians