𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


A sharp upper bound on algebraic connect
✍ M. Aouchiche; P. Hansen; D. StevanoviΔ‡ πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 760 KB

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

On upper bounds for the unified algebrai
✍ Adam Czornik; Aleksander Nawrat πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 223 KB

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