connected component of a graph (Q2997928)
Jump to navigation
Jump to search
maximal subgraph of a given node-link graph within which every two vertices may be connected by a path
- component of a graph
- graph component
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | connected component of a graph |
maximal subgraph of a given node-link graph within which every two vertices may be connected by a path |
|
Statements
Unconnected-graph.svg
203 × 194; 12 KB
203 × 194; 12 KB
Disconnected graph with three components (English)
0 references
Identifiers
1 reference
Sitelinks
Wikipedia(22 entries)
- cswiki Komponenta grafu
- cywiki Cydran gysylltiedig
- dewiki Zusammenhangskomponente (Graphentheorie)
- enwiki Component (graph theory)
- eswiki Componente (teoría de grafos)
- fawiki مؤلفه همبندی
- frwiki Composante connexe (théorie des graphes)
- hewiki רכיב קשירות (תורת הגרפים)
- huwiki Összefüggő komponens (gráfelmélet)
- itwiki Componente connessa (teoria dei grafi)
- kowiki 연결 요소 (그래프 이론)
- lmowiki Component connettuda
- plwiki Spójna składowa grafu
- rowiki Componentă conexă
- ruwiki Компонента связности графа
- skwiki Komponent grafu
- srwiki Компоненте повезаности (теорија графова)
- svwiki Komponent (grafteori)
- tawiki கூறு (கோட்டுருவியல்)
- ukwiki Компонента зв'язності графа
- viwiki Thành phần liên thông
- zhwiki 元件 (圖論)