We set G to be a connected graph of even order n ≥ b + 3, where b ≥ 3 is odd. We establish a sharp sufficient condition for the existence of an odd [1, b]-factor in terms of the signless Laplacian spectral radius q(G¯) of the complement graph. Specifically, if q(G¯)≤Φ(n,b)=n+2b−1+(n+2b−1)2−8b(b+1)2, then G has an odd [...
Zeng-Hui Shen, Jue Dai, Chang Liu et al.· Journal of Physics, Conferen...· 0 citations
A hybrid distance-spectral encoding that combines anchor-distance profiles with quantized low-frequency Laplacian-energy coordinates is studied, showing that hybrid encodings better recover syntactic-tree geometry than distance-only or spectral-only baselines.
Zi-Mo Yan, Yi-Fang Li, Hao Li et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.