If all the edge-deleted subgraphs of a graph are isomorphic then the graph is edge-transitive. Here is a possible reference, though you might want to look at this survey on pseudosimilarity. (Pseudosimilar edges give isomorphic subgraphs after being deleted but are not part of the same orbit under the automorphism group of the graph). For small $k$, having $k$ edge orbits is the same as having $k$ isomorphism classes of edge deleted subgraphs, as is proved here.

If all the edge-deleted subgraphs of a finite graph are isomorphic then the graph is edge-transitive. Here is a possible reference, though you might want to look at this survey on pseudosimilarity. (Pseudosimilar edges give isomorphic subgraphs after being deleted but are not part of the same orbit under the automorphism group of the graph). For finite graphs and small $k$, having $k$ edge orbits is the same as having $k$ isomorphism classes of edge deleted subgraphs, as is proved here.

If all the edge-deleted subgraphs of a graph are isomorphic then the graph is edge-transitive. Here is a possible reference, though you might want to look at this survey on pseudosimilarity. (Pseudosimilar edges give isomorphic subgraphs after being deleted but are not part of the same orbit under the automorphism group of the graph). For small $k$, having $k$ edge orbits is the same as having $k$ isomorphism classes of edge deleted subgraphs, as is proved here.

If all the edge-deleted subgraphs of a graph are isomorphic then the graph is edge-transitive. Here is a possible reference, though you might want to look at this survey on pseudosimilarity. (Pseudosimilar edges give isomorphic subgraphs after being deleted but are not part of the same orbit under the automorphism group of the graph). For small $k$, having $k$ edge orbits is the same as having $k$ isomorphism classes of edge deleted subgraphs, as is proved here.