The Sign Symmetric $P_{0,1}^+$-Matrix Completion Problem
Combinatorics
2024-05-30 v1
Abstract
We study sign symmetric -matrix completion problem. It is shown that any non-asymmetric incomplete digraph lacks sign symmetric -completion, digraphs of order at most four are completely classified and finally comparisons between sign symmetric -completion and other matrix completions was given.
Keywords
Cite
@article{arxiv.2405.19268,
title = {The Sign Symmetric $P_{0,1}^+$-Matrix Completion Problem},
author = {Victor Tomno and Linety Muhati},
journal= {arXiv preprint arXiv:2405.19268},
year = {2024}
}
Comments
10 Pages. Submitted to Linear and Multilinear Algebra