Geng, X., Hu, S. and Li, S. (2014) Permanental Bounds of the Laplacian Matrix of Trees with Given Domination Number. Graphs and Combinatorics, 31, 1423-1436.

The minimum spanning tree (MST) is a connected and undirected graph. MST is a collection of lines and dots with a line consisting of an undirected weight that connects all vertices and does not ...

LGNN is a lightweight, linear graph filtering layer based on the Laplace matrix of graphs. Through theoretical analysis, we demonstrate that a simple linear operation can effectively aggregate the ...

We address the problem of inferring an undirected graph from nodal observations, which are modeled as non-stationary graph signals generated by local diffusion dynamics that depend on the structure of ...

We address the problem of inferring an undirected graph from nodal observations, which are modeled as non-stationary graph signals generated by local diffusion dynamics that depend on the structure of ...