Open Access
| Issue |
RAIRO-Oper. Res.
Volume 60, Number 3, May-June 2026
|
|
|---|---|---|
| Page(s) | 1599 - 1619 | |
| DOI | https://doi.org/10.1051/ro/2026047 | |
| Published online | 19 June 2026 | |
- B.D. Acharya, Spectral criterion for cycle balance in networks. J. Graph Theory 4 (1980) 1–11. [Google Scholar]
- B. Bollobás and V. Nikiforov, Cliques and the spectral radius. J. Comb. Theory Ser. B 97 (2007) 859–865. [Google Scholar]
- A.E. Brouwer and W.H. Haemers, Spectra of Graphs. Springer (2011). [Google Scholar]
- M. Brunetti and Z. Stanić, Unbalanced signed graphs with extremal spectral radius or index. Comput. Appl. Math. 41 (2022) 118. [Google Scholar]
- D. Cartwright and F. Harary, Structural balance: a generalization of Heider's theory. Psychol. Rev. 63 (1956) 277–293. [CrossRef] [PubMed] [Google Scholar]
- S. Chaiken, A combinatorial proof of the all minors matrix tree theorem. SIAM J. Algebraic Discrete Methods 3 (1982) 319–329. [Google Scholar]
- F. Chen and X.Y. Yuan, Turán problem for K4−-free signed graphs. Appl. Math. Comput. 477 (2024) 128814. [Google Scholar]
- G. Ding, B. Oporowski, D.P. Sanders and D. Vertigan, Surfaces, tree-width, clique-minors, and partitions. J. Comb. Theory Ser. B 79 (2000) 221–246. [Google Scholar]
- E. Ghorbani and A. Majidi, Signed graphs with maximal index. Discrete Math. 344 (2021) 112463. [Google Scholar]
- E. Ghorbani and A. Majidi, Complete signed graphs with largest maximum or smallest minimum eigenvalue. Discrete Math. 347 (2024) 113860. [Google Scholar]
- F. Harary, On the notion of balance in a signed graph. Mich. Math. J. 2 (1953) 143–146. [Google Scholar]
- N. Kafai, F. Heydari, N.J. Rad and M. Maghasedi, On the signed complete graphs with maximum index. Iran. J. Sci. Technol. Trans. A Sci. 45 (2021) 2085–2090. [Google Scholar]
- T. Koledin and Z. Stanić, Connected signed graphs of fixed order, size, and number of negative edges with maximal index. Linear Multilinear Algebra 65 (2017) 2187–2198. [Google Scholar]
- D. Li, H.Q. Lin and J.X. Meng, Extremal spectral results related to spanning trees of signed complete graphs. Discrete Math. 346 (2023) 113250. [Google Scholar]
- V. Nikiforov, The spectral radius of graphs without paths and cycles of specified length. Linear Algebra Appl. 432 (2010) 2243–2256. [Google Scholar]
- M. Tait, The Colin de Verdière parameter, excluded minors, and the spectral radius. J. Comb. Theory Ser. A 166 (2019) 42–58. [Google Scholar]
- P. Turán, On an extremal problem in graph theory. Mat. Fiz. Lapok 48 (1941) 436–452. [Google Scholar]
- K. Wagner, Uber eine Eigenschaft der ebenen Komplexe. Math. Ann. 114 (1937) 570–590. [Google Scholar]
- Y.G. Wang, Spectral Turán problem for K5−-free signed graphs. Linear Algebra Appl. 691 (2024) 96–108. [Google Scholar]
- Y.G. Wang and H.Q. Lin, The largest eigenvalues of Ck−-free signed graphs. Discrete Appl. Math. 372 (2025) 164–172. [Google Scholar]
- W. Wang, Z.D. Yan and J.G. Qian, Eigenvalues and chromatic number of a signed graph. Linear Algebra Appl. 619 (2021) 137–145. [Google Scholar]
- D.J. Wang, Y.P. Hou and D.Q. Li, Extremed signed graphs for striangle. Preprint arXiv:2212.11460 (2022). [Google Scholar]
- J.J. Wang, Y.P. Hou and X.Y. Huang, Turán problem of signed graph for negative odd cycle. Discrete Appl. Math. 362 (2025) 157–166. [Google Scholar]
- H.S. Wilf, Spectral bounds for the clique and independence numbers of graphs. J. Comb. Theory Ser. B 40 (1986) 113–117. [Google Scholar]
- Z. Xiong and Y.P. Hou, Extremal results for Kr+1−-free signed graphs. Preprint arXiv:2311.15501 (2023). [Google Scholar]
- T. Zaslavsky, Signed graphs. Discrete Appl. Math. 4 (1982) 47–74. [Google Scholar]
- T. Zaslavsky, Biased graphs, I: bias, balance, and gains. J. Comb. Theory Ser. B 47 (1989) 32–52. [Google Scholar]
- M.Q. Zhai and H.Q. Lin, Spectral extrema of Ks,t-minor free graphs – on a conjecture of M. Tait. J. Comb. Theory Ser. B 157 (2022) 184–215. [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.