Assertion: graph's g | /r/HasProperty | graph
Facets:
value: with the edge
type: OTHER
value: with loops
type: OTHER
value: with vertex set v(g
type: OTHER
Source sentences:
text: G is a graph the vertices of which correspond to the edges of G, any two vertices of H being adjacent if and…
text: The contraction G / u v {\displaystyle G/uv} of a graph G is the graph obtained by identifying the vertices u and v, and removing any edges between them.
text: Let G = (V 1 , E 1 ) and C = (V 2 , E 2 ) be two graphs, and let f: V 2 → V 1 be a surjection.
text: Let G be a graph with vertex set V(G) and edge-list E(G).
text: Let G be a graph with loops, and let v be a vertex of G.
text: If G is a graph which has n vertices and is regular of degree r, then G has exactly 1/2 nr edges.
text: Suppose that G ( V , E ) {\displaystyle G(V,E)} is a graph on n {\displaystyle n} vertices.
text: due to Zykov (1949), where u and v are non-adjacent vertices, and G + u v {\displaystyle G+uv} is the graph with the edge uv added.
text: The term "dual" is used because the property of being a dual graph is symmetric, meaning that if H is a dual of a connected graph G, then G is a dual of H. When discussing the dual of a graph G, the graph G itself may be referred to as the "primal graph".