1 citations · 2 across the 19 of their papers we have counts for
8 papers · 1 filter
Spectral radius and spanning trees of graphs
Guoyan Ao, Ruifang Liu, Jinjiang Yuan
For integer a spanning -ended-tree is a spanning tree with at most leaves. Motivated by the closure theorem of Broersma and Tuinstra [Independence trees and Hamilt…
Laplacian eigenvalue distribution, diameter and domination number of trees
Jiaxin Guo, Jie Xue, Ruifang Liu
For a graph with domination number , Hedetniemi, Jacobs and Trevisan [European Journal of Combinatorics 53 (2016) 66-71] proved that , where m…
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…
Maxima of spectral radius of irregular graphs with given maximum degree
Jie Xue, Ruifang Liu
Let be the maximum spectral radius of connected irregular graphs on vertices with maximum degree . Liu, Shen and Wang (2007) conjectured that $\lim_{n\rightarrow \in…
Maxima of the -index of non-bipartite -free graphs
Ruifang Liu, Lu Miao, Jie Xue
A classic result in extremal graph theory, known as Mantel's theorem, states that every non-bipartite graph of order with size contains a tri…
Cubic bipartite graphs with minimum spectral gap
Ruifang Liu, Jie Xue
The difference between the two largest eigenvalues of the adjacency matrix of a graph is called the spectral gap of If is a regular graph, then its spectral gap is equ…
A spectral Erdős-Pósa Theorem
Zhai Mingqing, Liu Ruifang
A set of cycles is called independent if no two of them have a common vertex. Let be the complete split graph, which is the join of a clique of size with an in…
The maximum spectral radius of irregular bipartite graphs
Jie Xue, Ruifang Liu, Jiaxin Guo +1
A bipartite graph is subcubic if it is an irregular bipartite graph with maximum degree three. In this paper, we prove that the asymptotic value of maximum spectral radius over sub…