✦ LIBER ✦

An efficient lower bound for the generalized spectral radius of a set of matrices

✍ Scribed by Mohsen Maesumi

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 427 KB
Volume: 240
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)00171-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A sequence of lower bounds for the spect

A sequence of lower bounds for the spectral radius of nonnegatfve matrices

✍ Daniel B. Szyld 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A bound for the spectral radius of a mat

A bound for the spectral radius of a matrix

✍ James M Sloss 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 181 KB

An extremal problem for the spectral rad

An extremal problem for the spectral radius of a graph

✍ Miroslav Fiedler 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Lower bounds for the determinant and the

Lower bounds for the determinant and the trace of a class of Hermitian matrices

✍ Balder Ortner; Arnold R. Kräuter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 960 KB

An upper bound for the radius of a 3-con

An upper bound for the radius of a 3-connected graph

✍ Jochen Harant 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 286 KB

For a 3-connected graph with radius r containing n vertices, in [1] r < n/4 + O(log n) was proved and r < n/4 + const was conjectured. Here we prove r < n/4 + 8. Let G be a simple 3-connected finite graph on n vertices with vertex set V(G) and edge set E(G). For X, YE V(G) we denote by d(X, Y) the

A lower bound on the size of a complex g

A lower bound on the size of a complex generated by an antichain

✍ P. Frankl 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 427 KB

A short proof of the following result of Kleitman is given: the total number of sets contained in some member of an antichain of size (i) over the n-set is at least (E) + l --+ (i) for 0 < k G in. An equally short proof of Harper's isoperimetric theorem is provided as well.