An Analog of Matrix Tree Theorem for Signless Laplacians

Keivan Hassani Monfared, Sudipta Mallik

A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in…