I'm traying to prove (or disprove) the following statement:
Any connected $r$-regular graph of girth $g$ such that every edge is shared by the same number of minimum length cycles (that is, cycles of length $g$), is vertex-transitive and edge-transitive.
This is not a textbook exercise. Any ideas appreciated.
Thanks.