| http://www.w3.org/ns/prov#value | - In this regard, the graph is ???connected??? since there is a path connecting each of the vertices on the graph, and it is ???undirected??? since each path between a first vertex ???A??? and a second vertex ???B??? is identical in the ???A-to-B??? and the ???B-to-A??? directions.
|
