Connectivity of strong products of graphs (Q1959713): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-010-0919-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963704255 / rank | |||
Normal rank | |||
Revision as of 22:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity of strong products of graphs |
scientific article |
Statements
Connectivity of strong products of graphs (English)
0 references
7 October 2010
0 references
The strong product of graphs is one of the three commutative and associative graph products. Let \(S\) be the strong product of two given graphs. The author proves that every minimum separating set in \(S\) is either an \(I\)-set or an \(L\)-set in \(S\). This implies that the minimum separating sets in a strong product of graphs are induced by separating sets of factors. Finally, the definition of an \(I\)-set and an \(L\)-set is generalized for strong products of arbitrary finite number of factors.
0 references
connectivity
0 references
strong product
0 references
