Bondage number of grid graphs

Magda Dettlaff; Magdalena Lemańska; Ismael Gonzalez Yero

doi:10.1016/j.dam.2013.11.020

Bondage number of grid graphs

Abstract

The bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.

Citations

7

CrossRef
0

Web of Science
7

Scopus

Authors (3)

Magda Dettlaff dr inż.
Magdalena Lemańska dr inż.
Ismael Gonzalez Yero
- Departamento de Matemáticas, Escuela Politécnica Superior de Algeciras, Universidad de Cádiz Departamento de Matemáticas

Cite as

Full text

download paper

downloaded 19 times

Publication version: Accepted or Published Version
DOI:: Digital Object Identifier (open in new tab) 10.1016/j.dam.2013.11.020
License: Copyright (2013 Elsevier B.V)

full content of the article see on external site open in new tab

Keywords

Details

Category:: Articles
Type:: artykuł w czasopiśmie wyróżnionym w JCR
Published in:: DISCRETE APPLIED MATHEMATICS no. 167, pages 94 - 99,
ISSN: 0166-218X
Language:: English
Publication year:: 2014
Bibliographic description:: Dettlaff M., Lemańska M., Yero I.: Bondage number of grid graphs// DISCRETE APPLIED MATHEMATICS. -Vol. 167, (2014), s.94-99
DOI:: Digital Object Identifier (open in new tab) 10.1016/j.dam.2013.11.020
Verified by:: Gdańsk University of Technology