<http://webisa.webdatacommons.org/254336070>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://www.w3.org/ns/prov#Entity> .
<http://webisa.webdatacommons.org/prov/449978312>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://webisa.webdatacommons.org/254336070> .
<http://webisa.webdatacommons.org/254336070>	<http://www.w3.org/ns/prov#wasQuotedFrom>	<nist.gov> .
<http://webisa.webdatacommons.org/prov/516227481>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://webisa.webdatacommons.org/254336070> .
<http://webisa.webdatacommons.org/254336070>	<http://www.w3.org/ns/prov#value>	"Formal Definition: A graph G can be defined as a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ??? {(u,v) | u, v ??? V}." .