trivial graph
Смотреть что такое "trivial graph" в других словарях:
Trivial Graph Format — (TGF) is a very simple, text based, file format for describing graphs.A simple graph with 2 nodes and 1 edge might look like this:Example 1 First node2 Second node #1 2 Edge between the two Other Graph File Formats*GXL, graph exchange format… … Wikipedia
Trivial Graph Format — («простой формат графов», сокр. TGF) простой формат файлов, основанный на тексте, для описания графов. Пример Простой граф с 2 узлами и 1 ребром может выглядеть следующим образом: 1 Первый узел 2 Второй узел # 1 2 Ребро между ними Другие… … Википедия
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
Grafo trivial — de 1 vértice Vértices 0 ó 1 Aristas 0 … Wikipedia Español
Turán graph — The Turán graph T(13,4) Named after Pál Turán v · … Wikipedia
Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected … Wikipedia
Quantum graph — In mathematics and physics, a quantum graph is a linear, network shaped structure whose time evolution is described by a system of schrödinger equations or, more generally, by a set of evolution equations associated with differential or pseudo… … Wikipedia
Girth (graph theory) — In graph theory, the girth of a graph is the length of a shortest cycle contained in the graph.[1] If the graph does not contain any cycles (i.e. it s an acyclic graph), its girth is defined to be infinity.[2] For example, a 4 cycle (square) has… … Wikipedia
Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices … Wikipedia
Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… … Wikipedia
