A characterization of \(n\)-component graphs (Q1910584)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A characterization of \(n\)-component graphs |
scientific article; zbMATH DE number 858116
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of \(n\)-component graphs |
scientific article; zbMATH DE number 858116 |
Statements
A characterization of \(n\)-component graphs (English)
0 references
25 March 1996
0 references
An \(n\)-component of a graph \(G\) is a maximal \(n\)-connected subgraph. The authors give a characterization of the \(n\)-component graphs of finite simple undirected graphs. The vertex set of the \(n\)-component graph of \(G\) is represented by all its \(n\)-components, where two vertices are adjacent iff the corresponding components share at least one vertex of \(G\). The main result of the paper can be considered as an extension of an old result of Harary concerning 2-connected graphs.
0 references
components
0 references
connectivity
0 references
characterization
0 references
\(n\)-component graph
0 references
