http://orcid.org/0000-0002-4949-4203
References
- Simić SK, Li Marzi EM, Belardo F. Connected graphs of fixed order and size with maximal index: structural considerations. LeMatematiche. 2004;LIX:349–365.
- Bell F, Cvetković D, Rowlinson P, et al. Graphs for which the least eigenvalue is minimal, I. Linear Algebra Appl. 2008;429:234–241.
- Bell F, Cvetković D, Rowlinson P, et al. Graphs for which the least eigenvalue is minimal, II. Linear Algebra Appl. 2008;429:2168–2179.
- Belardo F. Li Marzi EM, Simić SK. Combinatorial approach for computing the characteristic polynomial of a matrix. Linear Algebra Appl. 1983;433:1513–1523.
- Simić SK, Stanić Z. Polynomial reconstruction of signed graphs whose least eigenvalue is close to −2. Submitted for publication.
- Simić SK, Kocić VLj. On the largest eigenvalue of some homeomorphic graphs. Publ Inst Math (Beograd). 1986;40:3–9.
- Harary F. On the notion of balance of a signed graph. Michigan Math J. 1953;2:143–146.
- Cartwright D, Harary F. Structural balance: a generalization of Heider’s theory. Psychol Rev. 1956;63:277–293.
- Heider F. Attitudes and cognitive organization. J Psychol. 1946;21:107–112.
- Stanić Z. Inequalities for graph eigenvalues. Cambridge: Cambridge University Press; 2015.