11 citations · 21 across the 10 of their papers we have counts for
11 papers · 1 filter
Extremal graphs for the maximum -spectral radius of graphs with order and size
Jie Zhang, Ya-Lei Jin, Hua Wang +2
In 1986, Brualdi and Solheid firstly proposed the problem of determining the maximum spectral radius of graphs in the set consisting of all simple connected gra…
The Distance Energy of Clique Trees
Ya-Lei Jin, Rui Gu, Xiao-Dong Zhang
The distance energy of a simple connected graph is defined as the sum of absolute values of its distance eigenvalues. In this paper, we mainly give a positive answer to a conje…
Equitable Partition Theorem of Tensors and Spectrum of Generalized Power Hypergraphs
Ya-Lei Jin, Jie Zhang, Xiao-Dong Zhang
In this paper, we present an equitable partition theorem of tensors, which gives the relations between -eigenvalues of a tensor and its quotient equitable tensor and extends the…
On majorization of closed walks vector of trees with given degree sequences
Ya-Hong Chen, Daniel Gray, Ya-Lei Jin +1
Let be the number of the closed walks of length starting at vertex in a tree . We prove that for a given tree degree sequence , then for any tree with de…
Laplacian Coefficient, Matching Polynomial and Incidence Energy of of Trees with Described Maximum Degree
Ya-Lei Jin, Yeong-Nan Yeh, Xiao-Dong Zhang
Let be the characteristic polynomial of its Laplacian matrix of a tree . This paper studied some properties of the generat…
On the spectral radius of simple digraphs with prescribed number of arcs
Ya-Lei Jin, Xiao-Dong Zhang
This paper presents a sharp upper bound for the spectral radius of simple digraphs with described number of arcs. Further, the extremal graphs which attain the maximum spectral rad…
The Minimum Spectral Radius of Graphs with the Independence Number
Ya-Lei Jin, Xiao-Dong Zhang
In this paper, we investigate some properties of the Perron vector of connected graphs. These results are used to characterize that all extremal connected graphs with having the mi…
Complete multipartite graphs are determined by their distance spectra
Ya-Lei Jin, Xiao-Dong Zhang
It is well known that the complete multipartite graphs can not be determined by their adjacency spectra. But in this paper, we prove that they can be determined by their distance s…
The Algebraic Connectivity and the Clique Number of Graphs
Ya-Lei Jin, Xiao-Dong Zhang
This paper investigates some relationship between the algebraic connectivity and the clique number of graphs. We characterize all extremal graphs which have the maximum and minimum…
On the Two Conjectures of the Wiener Index
Ya-Lei Jin, Xiao-Dong Zhang
The Wiener index of a graph, which is the sum of the distances between all pairs of vertices, has been well studied. Recently, Sills and Wang in 2012 proposed two conjectures on th…
Sharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number
Bian He, Ya-Lei Jin, Xiao-Dong Zhang
In this paper, we present a sharp upper and lower bounds for the signless Laplacian spectral radius of graphs in terms of clique number. Moreover, the extremal graphs which attain…