activity
20162023
most citedThe rank of a complex unit gain graph in terms of the rank of its underlying graph

1 citations · 2 across the 13 of their papers we have counts for

collaborators
Showing math.COShow all

23 papers · 1 filter

math.CO2023

Fractional revival on semi-Cayley graphs over abelian groups

Jing Wang, Ligong Wang, Xiaogang Liu

In this paper, we investigate the existence of fractional revival on semi-Cayley graphs over finite abelian groups. We give some necessary and sufficient conditions for semi-Cayley…

math.CO2023

Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number

Xiuwen Yang, Hajo Broersma, Ligong Wang

The -th Laplacian spectral moment of a digraph is defined as , where are the eigenvalues of the Laplacian matrix of and is a nonnegative in…

math.CO2023★ 1 cited

The sufficient conditions for -leaf-connected graphs in terms of several topological indices

Tingyan Ma, Ligong Wang, Yang Hu

Let be a graph with vertex set and edge set . For and given any subset with , if a graph of order $|V(G)|\geq k…

math.CO2022

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…

math.CO2022

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) =…

math.CO2021

On the spectral radius and energy of non-strongly connected digraphs

Xiuwen Yang, Ligong Wang

Let be the -matrix of a digraph and be the eigenvalues of . Let be the spectral radius of and $E_α(G)=…