The total bondage number of grid graphs

Details The total bondage number of grid graphs The total bondage number of grid graphs

2011-09-19

arxiv.org/abs/1109.3929v1

Mathematics

Combinatorics

15 pages with 4 figures

Scientific paper

The total domination number of a graph $G$ without isolated vertices is the minimum number of vertices that dominate all vertices in $G$. The total bondage number $b_t(G)$ of $G$ is the minimum number of edges whose removal enlarges the total domination number. This paper considers grid graphs. An $(n,m)$-grid graph $G_{n,m}$ is defined as the cartesian product of two paths $P_n$ and $P_m$. This paper determines the exact values of $b_t(G_{n,2})$ and $b_t(G_{n,3})$, and establishes some upper bounds of $b_t(G_{n,4})$.

Affiliated with

Also associated with

No associations

Rating

The total 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 The total bondage number of grid graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The total bondage number of grid graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96202