Problem: S1: Graphs in which vertices are inscribed and edges are indistinguishable are consequently called '' indistinguishable '' .
S2: Consequently , graphs in which vertices are unlabeled and edges are indistinguishable are called '' indistinguishable '' .

Do S1 & S2 convey the same information?

A: yes

Problem: S1: Simon Butler ( d. 1755 ) was a Welsh immigrant who , in 1712 , came to Pennsylvania with his cousin Simon Mathews .
S2: Simon Mathews ( b . 1755 ) was a Welsh immigrant who came to Pennsylvania in 1712 with his cousin Simon Butler .

Do S1 & S2 convey the same information?

A: no

Problem: S1: He acquired homes in Mar del Plata , a castle in Buenos Aires and a small hotel in Cordoba .
S2: He bought homes in Mar del Plata , a castle in Buenos Aires and a small hotel in Cordoba .

Do S1 & S2 convey the same information?

A:
yes