The bondage number of the strong product of a complete graph with a path and a special starlike tree (Q2798318)
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: The bondage number of the strong product of a complete graph with a path and a special starlike tree |
scientific article; zbMATH DE number 6567345
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bondage number of the strong product of a complete graph with a path and a special starlike tree |
scientific article; zbMATH DE number 6567345 |
Statements
The bondage number of the strong product of a complete graph with a path and a special starlike tree (English)
0 references
12 April 2016
0 references
bondage number
0 references
strong product of graphs
0 references
complete graph
0 references
The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. The first main result of this paper determines the bondage number of strong products of complete graphs with paths. The second main result is a parallel result for strong products in which one factor is again complete, while the other factor is a starlike tree where all rays are of the same parity modulo 3.
0 references
