Upper bounds on algebraic connectivity via convex optimization
β Scribed by Arpita Ghosh; Stephen Boyd
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 185 KB
- Volume
- 418
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let G be a connected graph of order n. The algebraic connectivity of G is the second smallest eigenvalue of the Laplacian matrix of G. A dominating set in G is a vertex subset S such that each vertex of G that is not in S is adjacent to a vertex in S. The least cardinality of a dominating set is the
In recent years, several eigenvalues, norms and determinants bounds have been investigated separately for the solutions of continuous and discrete Riccati equations. In this paper, an upper bound for solution of the unified Riccati equation is presentec~. In the limiting cases, the result reduces to