7 citations · 33 across the 43 of their papers we have counts for
6 papers · 1 filter
An improvement of sufficient condition for -leaf-connected graphs
Tingyan Ma, Guoyan Ao, Ruifang Liu +2
For integer a graph is called -leaf-connected if and given any subset with always has a spanning tree such that…
The spectral radius with given independence number
Xichan Liu, Ligong Wang
Let be a graph with adjacency matrix and degree diagonal matrix . In 2017, Nikiforov [Appl. Anal. Discrete Math., 11 (2017) 81--107] defined the matrix $A_α(G) =…
The spectral radius of -connected graphs with given diameter
Xichan Liu, Ligong Wang
Let be a graph with adjacency matrix and degree diagonal matrix . In 2017, Nikiforov defined the matrix for any real . The…
Fractional revival on Cayley graphs over abelian groups
Jing Wang, Ligong Wang, Xiaogang Liu
In this paper, we investigate the existence of fractional revival on Cayley graphs over finite abelian groups. We give a necessary and sufficient condition for Cayley graphs over f…
Signless Laplacian Estrada index and Laplacian Estrada index of uniform hypergraphs
Cunxiang Duan, Edwin R. van Dam, Ligong Wang
We generalize the notions of Laplacian and signless Laplacian Estrada index to uniform hypergraphs. For an -uniform hypergraph we derive an order trace formula of the…
Linear Turán numbers of acyclic quadruple systems
Lin-Peng Zhang, Ligong Wang
A linear -uniform hypergraph is called acycilc if it can be constructed starting from one single edge then at each step adding a new edge that intersect the union of the vertice…