Bondage number of grid graphs

Details Bondage number of grid graphs Bondage number of grid graphs

2012-04-02

arxiv.org/abs/1204.0533v1

Mathematics

Combinatorics

20 pages

Scientific paper

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 Cartesian product, strong product or direct product of two paths.

Affiliated with

Also associated with

No associations

Rating

Bondage number of grid graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bondage number of grid graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bondage number of grid graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353303