| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649662 | Discrete Mathematics | 2009 | 5 Pages |
Abstract
In this paper we will prove that μ(G)+μ(G¯)≤1+32n−1. where μ(G),μ(G¯) are the greatest eigenvalues of the adjacency matrices of the graph GG and its complement and nn denotes the number of vertices of GG.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Péter Csikvári,