I'm aware this result holds for simple graphs:
Given a simple graph and its complement, prove that either of them is always connected.
Does it hold for directed and not strongly connected graphs?
I'm aware this result holds for simple graphs:
Given a simple graph and its complement, prove that either of them is always connected.
Does it hold for directed and not strongly connected graphs?
Copyright © 2021 JogjaFile Inc.