Abstract

We show by a constructive proof, that if a unicyclic graph has a transposition in its automorphism group, then it is stable. Using a similar technique, we also determine which unicyclic graphs are not semi-stable.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call