Assertion: graph | /r/HasAspect | edge
Facets:
value: for each intersecting pair of curves
type: OTHER
value: between the vertices
type: LOCATION
Source sentences:
text: This graph is not simple because it has an edge not satisfying (2).
text: This graph is not simple because it has 2 edges between the vertices A and B.
text: We will find how many edges this graph can have.
text: Dirac and Ore's theorems basically state that a graph is Hamiltonian if it has enough edges.
text: We say that the graph has multiple edges if in the graph two or more edges joining the same pair of vertices.
text: But hang on a second — what if our graph has more than one node and more than one edge!
text: Given a graph G, G is a string graph if and only if there exists a set of curves, or strings, drawn in the plane such that no three strings intersect at a single point and such that the graph having a vertex for each curve and an edge for each intersecting pair of curves is isomorphic to G.
text: As you can see in the example below, a graph is a structured data type that has nodes and edges: nodes usually hold information about an entity, edges indicate connections, and weights may be used to further define the connections (e.g. probability of moving from an entity to another, the strength of a connection).