Ligong Wang

activity

20162021

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

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

collaborators

20 papers

math.CO2022

An improvement of sufficient condition for $k$ -leaf-connected graphs

Tingyan Ma, Guoyan Ao, Ruifang Liu +2

For integer $k \geq 2,$ a graph $G$ is called $k$ -leaf-connected if $∣ V (G) ∣ \geq k + 1$ and given any subset $S \subseteq V (G)$ with $∣ S ∣ = k,$ $G$ always has a spanning tree $T$ such that…

math.CO2022

The $A_{α}$ spectral radius with given independence number $n - 4$

Xichan Liu, Ligong Wang

Let $G$ be a graph with adjacency matrix $A (G)$ and degree diagonal matrix $D (G)$ . In 2017, Nikiforov [Appl. Anal. Discrete Math., 11 (2017) 81--107] defined the matrix $A_α(G) =…

math.CO2021

On the $A_{α}$ spectral radius and $A_{α}$ energy of non-strongly connected digraphs

Xiuwen Yang, Ligong Wang

Let $A_{α} (G)$ be the $A_{α}$ -matrix of a digraph $G$ and $λ_{α 1}, λ_{α 2}, \dots, λ_{α n}$ be the eigenvalues of $A_{α} (G)$ . Let $ρ_{α} (G)$ be the $A_{α}$ spectral radius of $G$ and $E_α(G)=…

math.CO2021

On the $A_{α}$ spectral radius of strongly connected digraphs

Weige Xi, Ligong Wang

Let $G$ be a digraph with adjacency matrix $A (G)$ . Let $D (G)$ be the diagonal matrix with outdegrees of vertices of $G$ . Nikiforov \cite{Niki} proposed to study the convex combinat…

math.CO2020

The generalized Turán number of spanning linear forests

Lin-Peng Zhang, Ligong Wang, Jiale Zhou

Let $F$ be a family of graphs. A graph $G$ is called \textit{ $F$ -free} if for any $F \in F$ , there is no subgraph of $G$ isomorphic to $F$ . Given a gra…

math.CO2020

The bounds of the spectral radius of general hypergraphs in terms of clique number

Cunxiang Duan, Ligong Wang

The spectral radius (or the signless Laplacian spectral radius) of a general hypergraph is the maximum modulus of the eigenvalues of its adjacency (or its signless Laplacian) tenso…

An improvement of sufficient condition for k-leaf-connected graphs

The Aα​ spectral radius with given independence number n−4

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