On the sizes of graphs and their powers: The undirected case
✍ Scribed by David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein
- Book ID
- 113564621
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 430 KB
- Volume
- 159
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For a simple, undirected graph q n , let k i q n be the ith largest eigenvalue of q n . This paper presents mainly the following: 1. For n P 4, if q n is incomplete, then 2. Seven sucient and necessary conditions such that k 2 q n À1. 3. k 3 q n À1 implies that k j q n À1Y j 3Y 4Y F F F Y n À 1.
With the help of the undirected graph of a matrix we establish new theorems for estimating the singular values. The location of singular values of a matrix A is described in terms of its deleted absolute row sums and column sums. The formulation has an appearance analogous to Brauer's and Brualdi's