Undirected graph
From Fresh Dictionary
Contents
1
English
1.1
Noun phrase
1.1.1
Synonyms
1.2
See also
[
edit
]
English
[
edit
]
Noun phrase
undirected
graph
(
plural
undirected graphs
)
(
graph theory
) A
graph
in which the
edges
are not
ordered
, so the edge (a, b) is identical to the edge (b, a).
[
edit
]
Synonyms
graph
[
edit
]
See also
directed graph
Category
:
Graph theory
Views
Article
Discussion
Edit
History
Personal tools
Log in / create account
Search