caa a22 4500 445358521 CHVBK 20180317142908.0 cr unu---uuuuu 170323e20111201xx s 000 0 eng 10.1007/s00493-011-2652-1 doi (NATIONALLICENCE)springer-10.1007/s00493-011-2652-1 Terpai Tamás Alfréd Rényi Institute of Mathematics, Reáltanoda u. 13-15., 1053, Budapest, Hungary aut Proof of a conjecture of V. Nikiforov [Elektronische Daten] [Tamás Terpai] Using analytical tools, we prove that for any simple graph G on n vertices and its complement $$\bar G$$ the inequality $$\mu \left( G \right) + \mu \left( {\bar G} \right) \leqslant \tfrac{4} {3}n - 1$$ holds, where μ(G) and $$\mu \left( {\bar G} \right)$$ denote the greatest eigenvalue of adjacency matrix of the graphs G and $$\bar G$$ respectively. János Bolyai Mathematical Society and Springer Verlag, 2011 Combinatorica Springer-Verlag 31/6(2011-12-01), 739-754 0209-9683 31:6<739 2011 31 493 https://doi.org/10.1007/s00493-011-2652-1 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s00493-011-2652-1 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Terpai Tamás Alfréd Rényi Institute of Mathematics, Reáltanoda u. 13-15., 1053, Budapest, Hungary aut NATIONALLICENCE 773 0- Combinatorica Springer-Verlag 31/6(2011-12-01), 739-754 0209-9683 31:6<739 2011 31 493 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer