HW4 Q1A
Guy (guest) 28 May 2019 08:28
Hi,
I have question regard to the property of the diameter. the graph should have n nodes with diameter n, which by definition says that there is shortest path between 2 nodes that should traverse all nodes.
such a path is not (d,r)-robust (i mean that if its the only path in the graph). so, in order to make the graph (d,r)-robust we should introduce "short-cuts", but those short-cuts make the diameter of the
graph smaller than n…
so, it seems to me that this 2 requirements contradicts each other.
its ok to say that i am wrong, and ask me to rethink about it :)
Thanks,
Guy
