Assertion: graph's vertex | /r/HasProperty | replaced by connected graph
Facets:
value: v \displaystyle g_{v
type: OTHER
Source sentences:
text: Given a graph G {\displaystyle G} , and another graph G ′ {\displaystyle G'} , G ′ {\displaystyle G'} is called an I G {\displaystyle IG} if G ′ {\displaystyle G'} is formed from G {\displaystyle G} by replacing the vertices of G {\displaystyle G} with connected graphs such that if a vertex v {\displaystyle v} is replaced by a connected graph G v {\displaystyle G_{v}} , there are edges connecting G v {\displaystyle G_{v}} to each of the graphs replacing the vertices that are adjacent to v {\displaystyle v} in G {\displaystyle G} , and only to those graphs.