Assertion: graph's vertex | /r/HasProperty | connected by edge
Facets:
value: to each vertex
type: TRANSITIVE-OBJECT
value: for 1
type: TEMPORAL
Source sentences:
text: When each vertex is connected by an edge to every other vertex, the graph is called a complete graph.
text: Thus two vertices may be connected by more than one edge.
text: Another class of graphs is the collection of the complete bipartite graphs K m, n , which consist of the simple graphs that can be partitioned into two independent sets of m and n vertices such that there are no edges between vertices within each set and every vertex in one set is connected by an edge to every vertex in the other set.
text: A path graph (or linear graph ) consists of n vertices arranged in a line, so that vertices i and i +1 are connected by an edge for i =1,...
text: (or ) consists of vertices arranged in a line, so that vertices and +1 are connected by an edge for =1,..., −1.
text: If vertices are connected by an edge, they are called adjacent.
text: A chordless cycle in a graph, also called a hole or an induced cycle, is a cycle such that no two vertices of the cycle are connected by an edge that does not itself belong to the cycle.
text: n, y-coordinates being in the range 1,..., m, and two vertices are connected by an edge whenever the corresponding points are at distance 1.
text: We use the adjacency-lists representation, where we maintain a vertex-indexed array of lists of the vertices connected by an edge to each vertex.
text: This article is about sets of vertices connected by edges.
text: A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines).
text: This article is about sets of vertices connected by edges.
text: In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by edges, where the edges have a direction associated with them.
text: A path in a graph is a sequence of vertices connected by edges, with no repeated edges.