Sentence 1: Graphs in which vertices are inscribed and edges are indistinguishable are consequently called '' indistinguishable '' .
Sentence 2: Consequently , graphs in which vertices are unlabeled and edges are indistinguishable are called '' indistinguishable '' .

Do these two sentences convey the same information?

pick from the following. a). no b). yes
b).