﻿

# undirected graph

A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).

Wikipedia foundation.

### Look at other dictionaries:

• undirected graph — neorientuotasis grafas statusas T sritis automatika atitikmenys: angl. undirected graph vok. ungerichteter Graph, m rus. неориентированный граф, m pranc. graphe non orienté, m …   Automatikos terminų žodynas

• Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges …   Wikipedia

• Graph automorphism — In graph theoretical mathematics, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge vertex connectivity.Formally, an automorphism of a graph G = ( V , E ) is a permutation sigma;… …   Wikipedia

• Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

• graph theory — A branch of mathematics used to represent relations and networks. A graph consists of a set of points (nodes or vertices) and the pairwise links between them (arcs or lines). In sociological applications, the nodes are typically individuals,… …   Dictionary of sociology

• graph — 1. noun /ɡɹɑːf,ɡɹæf/ a) A diagram displaying data; in particular one showing the relationship between two or more quantities, measurements or indicative numbers that may or may not have a specific mathematical formula relating them to each other …   Wiktionary

• Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… …   Wikipedia

• undirected path — noun In a directed graph, a path in which the edges are not all oriented in the same direction. A path x rarr;y larr;z is an undirected path. Ant: directed path …   Wiktionary

• Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

• Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of: a set V, whose elements are called vertices or …   Wikipedia