Abstract
We prove that the graph obtained from the non-nilpotent graph of a finite group by deleting the isolated vertices is connected with diameter at most 3. This bound is the best possible.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have