𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimum semidefinite rank of the complement of partial -trees

✍ Scribed by John Sinkovic; Hein van der Holst

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
194 KB
Volume
434
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A minimum principle and estimates of the
A minimum principle and estimates of the eigenvalues for schur complements positive semidefinite hermitian matrices
✍ Jianzhou Liu; Li Zhu πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 536 KB

We give a minimum principle for Sehur complements of positive definite Herrnitian matrices. Further, we obtain some inequalities for the eigenvalues of Schur complements of products and sums of positive definite Hermitian matrices.

The size of minimum 3-trees
The size of minimum 3-trees
✍ Jorge L. Arocha; JoaquΓ­n Tey πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 199 KB

## Abstract A 3‐uniform hypergraph (3‐graph) is said to be tight, if for any 3‐partition of its vertex set there is a transversal triple. We give the final steps in the proof of the conjecture that the minimum number of triples in a tight 3‐graph on __n__ vertices is exactly $\left\lceil n(n-2)/3 \

An independent dominating set in the com
An independent dominating set in the complement of a minimum dominating set of a tree
✍ Michael A. Henning; Christian LΓΆwenstein; Dieter Rautenbach πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 267 KB

We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T , there is an independent dominating set I of T which is disjoint from D. This confirms a recent conjecture of Johnson, Prier, and Walsh.