Binary negated graph

20 Views Asked by At

This is question out of curiosity.

Recently I am working with graphs (and directed graphs), and found out that I need a condition that the elementwise negated adjacency matrix has only one strongly connected component.

I searched a little bit the literature, but found nothing about negated adjacency matrices. Can someone point me to some literature maybe? I cannot believe no one studied this before.