Abstract
A regular and edge-transitive graph that is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the autom...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have