Could anyone help me construct two examples: 1. a non-regular graph which has the property that the open neighborhoods of any two vertices do not contain each other? 2. minimal asymmetric graph which has the property that the open neighborhoods of any two vertices do not contain each other?
Thanks!