Bondage Number of Lexicographic Product of Two 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 a domination number greater than the domination number of G. In this paper, we study the bondage number of the Lexicographic product of two paths, Lexicographic product of path and a graph with given maximum degree.