Open Access
| Issue |
RAIRO-Oper. Res.
Volume 60, Number 4, July-August 2026
|
|
|---|---|---|
| Page(s) | 2311 - 2321 | |
| DOI | https://doi.org/10.1051/ro/2026079 | |
| Published online | 31 July 2026 | |
- N. Alon, Tough Ramsey graphs without short cycles. J. Algebr. Comb. 3 (1995) 189–195. [Google Scholar]
- A.E. Brouwer, Toughness and spectrum of a graph. Linear Algebra Appl. 226/228 (1995) 267–271. [Google Scholar]
- A.E. Brouwer and W.H. Haemers, Spectra of Graphs. Springer, Berlin (2011). [Google Scholar]
- Y. Chen, D. Fan and H. Lin, Toughness and spectral radius in graphs. Discrete Math. 347 (2024) 114191. [Google Scholar]
- H. Chen, J. Li and S. Xu, Two variants of toughness of a graph and its eigenvalues. Graphs Comb. 41 (2025) 41. [Google Scholar]
- V. Chvátal, Tough graphs and Hamiltonian circuits. Discrete Math. 3 (1973) 215–228. [Google Scholar]
- H. Enomoto, Note toughness and the existence of k-factors III. Discrete Math. 189 (1998) 277–282. [Google Scholar]
- D. Fan, H. Lin and H. Lu, Toughness, hamiltonicity and spectral radius in graphs. Eur. J. Comb. 110 (2023) 103701. [Google Scholar]
- C.D. Godsil, Algebraic Combinatorics. Chapman and Hall Mathematics Series. Chapman and Hall, New York (1993). [Google Scholar]
- C. Godsil and G.F. Royle, Algebraic Graph Theory. Springer-Verlag, New York (2001). [Google Scholar]
- W. Gao, W. Wang and Y. Chen, Tight bounds for the existence of path factors in network vulnerability parameter settings. Int. J. Intell. Syst. 36 (2021) 1133–1158. [Google Scholar]
- W. Gao, W. Wang and Y. Chen, Tight toughness variant condition for fractional k-factors. Ars Math. Contemp. 26 (2026) P1.04. [Google Scholar]
- X. Gu, Toughness in pseudo-random graphs. Eur. J. Comb. 92 (2021) 103255. [Google Scholar]
- X. Gu, A proof of Brouwer’s toughness conjecture. SIAM J. Discrete Math. 35 (2021) 948–952. [Google Scholar]
- W.H. Haemers, Interlacing eigenvalues and graphs. Linear Algebra Appl. 226 (1995) 593–616. [Google Scholar]
- R.A. Horn and C.R. Johnson, Matrix Analysis. Cambridge University Press, Cambridge (1985). [Google Scholar]
- J. Lou, R. Liu and J. Shu, Toughness and distance spectral radius in graphs involving minimum degree. Discrete Appl. Math. 361 (2025) 34–47. [Google Scholar]
- Y. Zhang and H. Lin, Perfect matching and distance spectral radius in graphs and bipartite graphs. Discrete Appl. Math. 304 (2021) 315–322. [Google Scholar]
- B. Zhou and N. Trinajstić, On the largest eigenvalue of the distance matrix of a connected graph. Chem. Phys. Lett. 447 (2007) 384–387. [Google Scholar]
- B. Zhou and N. Trinajstić, Further results on the largest eigenvalues of the distance matrix and some distance-based matrices of connected (molecular) graphs. Internet Electron. J. Mol. Des. 6 (2020) 375–384. [Google Scholar]
- B. Zhou and N. Trinajstić, Mathematical properties of molecular descriptors based on distances. Croat. Chem. Acta 83 (2010) 227–242. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.