3 citations · 4 across the 14 of their papers we have counts for
14 papers
Spectral extremal problems for fractional --factor-critical graphs
Zengzhao Xu, Ligong Wang, Weige Xi
A factor of a graph is essentially a specific type spanning subgraph. In recent years, the spectral extremal problem of characterizing the existence of graph factors via eigenvalue…
Spectral extremal problems for -critical and fractional -critical graphs
Zengzhao Xu, Ligong Wang, Weige Xi
A factor of a graph is essentially a specific type spanning subgraph. The study of characterizing the existence of -factors based on eigenvalue conditions can be traced bac…
Spectral radius and size conditions for fractional -covered graphs
Zengzhao Xu, Ligong Wang, Weige Xi
A fractional -covered graph is a generalization of the concept of a fractional -covered graph. For any with edge set , if there exists a…
Ordering digraphs with maximum outdegrees by their spectral radius
Zengzhao Xu, Weige Xi, Ligong Wang
Let be a strongly connected digraph with vertices and arcs. For any real , the matrix of a digraph is defined as where…
On the spectral radius of non-transmission regular graphs
Zengzhao Xu, Weige Xi, Ligong Wang
Let be a connected graph with order and size . Let and be the distance matrix and diagonal matrix with vertex transmissions of , respectively. For any…
Matching, odd -factor and distance spectral radius of graphs with given some parameters
Zengzhao Xu, Weige Xi, Ligong Wang
For a connected graph , let denote the distance spectral radius of . A matching in a graph is a set of disjoint edges of . The maximum size of a matching in …
On the distance spectral radius, fractional matching and factors of graphs with given minimum degree
Zengzhao Xu, Weige Xi, Ligong Wang
A fractional matching of is a function such that for any , where $E_G(v_i)=\{e: e\in E(G) \ \textrm{and}\ e \ \t…
On the spectral radius and energy of digraphs
Weige Xi
Let be a digraph with adjacency matrix and outdegrees diagonal matrix . For any real , the matrix of a digraph is defined as $A_α(G)=…
On the spectral radius of strongly connected digraphs
Weige Xi, Ligong Wang
Let be a digraph with adjacency matrix . Let be the diagonal matrix with outdegrees of vertices of . Nikiforov \cite{Niki} proposed to study the convex combinat…
The generalized distance matrix of digraphs
Weige Xi, Wasin So, Ligong Wang
Let and be the distance matrix and distance signless Laplacian matrix of a simple strongly connected digraph , respectively, where $Diag(Tr)=\te…
Merging the A- and Q-spectral theories for digraphs
Weige Xi, Wasin So, Ligong Wang
Let be a digraph and be the adjacency matrix of . Let be the diagonal matrix with outdegrees of vertices of . For any real , Liu et al. \cite{LWC…
The unicyclic graphs with the second smallest normalized Laplacian eigenvalue no less than
Weige Xi, Ligong Wang, Xiangxiang Liu +2
Let be the second smallest normalized Laplacian eigenvalue of a graph . In this paper, we determine all unicyclic graphs of order with $λ_{2}(G)\geq 1-\frac…
The minimum Q-index of strongly connected bipartite digraphs with complete bipartite subdigraphs
Weige Xi, Ligong Wang
Let denote the set of strongly connected bipartite digraphs on vertices which contain a complete bipartite subdigraph , wher…
Some upper bounds for the signless Laplacian spectral radius of digraphs
Weige Xi, Ligong Wang
Let be a digraph without loops and multiarcs, where and are the vertex set and the arc set of , respectively. Let …