undirected graph

undirected graph

[¦ən·də‚rek·təd ′graf]
(mathematics)
A graph whose edges are not assigned directions.
References in periodicals archive ?
The total number of links to be in the network is derived from the LD value for undirected graph.
For a parallel chip-firing game a on undirected graph G with period T, let P be the set of all PFPs occurring in [sigma] and let Q be the set of all clumpy PFPs occurring in [sigma].
Unfortunately, the problem of determining the MCDS in an undirected graph, like that of the unit disk graph considered for modeling MANETs, is NP-complete.
Given a connected, undirected graph G = (V, E) , where V is the set of nodes, E is the set of edges between pairs of nodes, and a weight w (u , v) specifying weight of the edge (u, v) for each edge (u, v) [member of] E.
input : a connected, unweighted, and undirected graph G(V, E) output : locally supported eigenvectors Z and orthogonal complement Q identify a family of small subsets [{[S.
It is a directed or undirected graph consisting of vertexes, which represent concepts, and edges.
By a graph we mean a finite undirected graph without loops or multiple edges.
Let G be a undirected graph with a vertex set V and an edge set E.
An undirected graph imposes no order on the vertex pair representing an edge; thus, the edge ([v.
By a graph, G = (V,E) we mean a simple, finite undirected graph.
Example 2: Given an undirected graph G(V, E) with a weight function on the edges: W: E [right arrow] [R.