Eigenvalue problems of Nordhaus--Gaddum type (Q868345)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5130436
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Eigenvalue problems of Nordhaus--Gaddum type |
scientific article; zbMATH DE number 5130436 |
Statements
Eigenvalue problems of Nordhaus--Gaddum type (English)
0 references
2 March 2007
0 references
Consider a graph \(G\) with \(\nu(G)=n\) vertices. The eigenvalues of the adjacency matrix of \(G\) are arranged as \(\mu_1(G)\geq\cdots\geq\mu_n(G)\). Let \(\overline{G}\) denote the complement of \(G\). In this paper for \(k\) fixed and \(n\) large, estimates are derived for \[ f_k(n)=\max_{\nu(G)=n}| \mu_k(G)| +| \mu_k(\overline{G})| . \] It is shown that for some \(c>10^{-7}\) independent of \(n\) \[ \frac{4}{3}n-2\leq f_1(n)<(\sqrt{2}-c)n \] and \[ \frac{\sqrt{2}}{2}n-3<f_2(n)<\frac{\sqrt{2}}{2}n,\\ \frac{\sqrt{2}}{2}n-3<f_n(n)\leq\frac{\sqrt{3}}{2}n. \]
0 references
graph eigenvalues
0 references
complementary graph
0 references
maximum eigenvalue
0 references
minimum eigenvalue
0 references
Nordhaus-Gaddum problems
0 references
0.96222657
0 references
0 references
0.9026374
0 references
0.9012645
0 references
0.8972939
0 references
0.8958842
0 references