Displaying similar documents to “The rank of a cograph.”

A note on the Chvátal-rank of clique family inequalities

Arnaud Pêcher, Annegret K. Wagler (2007)

RAIRO - Operations Research

Similarity:


Clique family inequalities , form an intriguing class of valid inequalities for the stable set polytopes of all graphs. We prove firstly that their Chvátal-rank is at most , which provides an alternative proof for the validity of clique family inequalities, involving only standard rounding arguments. Secondly, we strengthen the upper bound further and discuss consequences regarding the Chvátal-rank of subclasses of claw-free graphs.


A new rank formula for idempotent matrices with applications

Yong Ge Tian, George P. H. Styan (2002)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

It is shown that rank ( P * A Q ) = rank ( P * A ) + rank ( A Q ) - rank ( A ) , where A is idempotent, [ P , Q ] has full row rank and P * Q = 0 . Some applications of the rank formula to generalized inverses of matrices are also presented.

Trace and determinant in Banach algebras

Bernard Aupetit, H. Mouton (1996)

Studia Mathematica

Similarity:

We show that the trace and the determinant on a semisimple Banach algebra can be defined in a purely spectral and analytic way and then we obtain many consequences from these new definitions.