2 citations · 2 across the 6 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
math.CO2025
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…
math.CO2025
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…
math.CO2025
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…