𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The completable digraphs for the totally nonnegative completion problem

✍ Scribed by Cristina Jordán; Juan-R. Torregrosa; Ramadán el-Ghamry

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
173 KB
Volume
430
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The copositive completion problem
The copositive completion problem
✍ Leslie Hogben; Charles R. Johnson; Robert Reams 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 163 KB
The difference between doubly nonnegativ
The difference between doubly nonnegative and completely positive matrices
✍ Samuel Burer; Kurt M. Anstreicher; Mirjam Dür 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 223 KB

The convex cone of n × n completely positive (CP) matrices and its dual cone of copositive matrices arise in several areas of applied mathematics, including optimization. Every CP matrix is doubly nonnegative (DNN), i.e., positive semidefinite and component-wise nonnegative, and it is known that, fo

Isomorphic factorization of the complete
Isomorphic factorization of the complete graph into Cayley digraphs
✍ G. L. Chia; Poh-Hwa Ong 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract Let __Z__~__p__~ denote the cyclic group of order __p__ where __p__ is a prime number. Let __X__ = __X__(__Z__~__p__~, __H__) denote the Cayley digraph of __Z__~__p__~ with respect to the symbol __H__. We obtain a necessary and sufficient condition on __H__ so that the complete graph on