Assertion: graph | /r/HasProperty | undirected
Facets:
value: sometimes
type: TEMPORAL
value: for distinguishing from a directed graph
type: PURPOSE
Source sentences:
text: For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this graph is undirected because any person A can shake hands with a person B only if B also shakes hands with A.
text: A graph $G = (V, E)$ is called a directed graph if the edge set is made of ordered vertex pair and a graph is called undirected if the edge set is made of unordered vertex pair.
text: A graph (sometimes called undirected graph for distinguishing from a directed graph, or simple graph for distinguishing from a multigraph) is a pair G = (V, E), where V is a set whose elements are called vertices (singular: vertex), and E is a set of two-sets (sets with two distinct elements) of vertices, whose elements are called edges (sometimes links or lines).
text: In addition, graph properties can be classified according to the type of graph they describe: whether the graph is undirected or directed, whether the property applies to multigraphs, etc.
text: A graph is called simple graph/strict graph if the graph is undirected and does not contain any loops or multiple edges.
text: A graph is undirected if the edge set is composed of unordered vertex pair.
text: If the graph is undirected, the adjacency relation defined by the edges is symmetric, or E ⊆ {{u,v} | u, v ∈ V} (sets of vertices rather than ordered pairs).
text: A graph may be either undirected or directed.