2 citations · 2 across the 6 of their papers we have counts for
6 papers
Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices
Jiachang Ye, Jianguo Qian, Zoran Stanic
Two graphs are said to be -cospectral if they share the same signless Laplacian spectrum. A simple graph is said to be determined by its signless Laplacian spectrum (abbreviated…
Signless Laplacian spectral analysis of a class of graph joins
Jiachang Ye, Zoran Stanić, Jianguo Qian
A graph is said to be determined by its signless Laplacian spectrum (abbreviated as DQS) if no other non-isomorphic graph shares the same signless Laplacian spectrum. In this paper…
Determining some graph joins by the signless Laplacian spectrum
Jiachang Ye, Jianguo Qian, Zoran Stanić
A graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let , , and $K_{s,l…
Which -cospectral graphs have same degree sequences
Jiachang Ye
Let be the -th largest Laplacian eigenvalues of graph , where . Liu, Yuan, You and Chen [Discrete Math., 341 (2018) 2969--2976] raised the proble…
Extremal spectral radius of weighted adjacency matrices of bicyclic graphs
Jiachang Ye, Junli Hu, Xiaodan Chen
The weighted adjacency matrix of a simple graph is the matrix whose -entry equals , where is a symmetric function suc…
Extremal Polygonal Cacti for General Sombor Index
Jiachang Ye, Jianguo Qian
The Sombor index of a graph was recently introduced by Gutman from the geometric point of view, defined as , where is the de…