Graphs in which vertices are inscribed and edges are indistinguishable are consequently called `` indistinguishable '' .
Consequently , graphs in which vertices are unlabeled and edges are indistinguishable are called `` indistinguishable '' .