The Bondage Number of Mesh Networks

Details The Bondage Number of Mesh Networks The Bondage Number of Mesh Networks

2011-09-19

arxiv.org/abs/1109.3927v1

Mathematics

Combinatorics

10 pages with 1 figures

Scientific paper

The bondage number $b(G)$ of a nonempty graph $G$ is the smallest number of
edges whose removal from $G$ results in a graph with domination number greater
than that of $G$. Denote $P_n\times P_m$ be the Cartesian product of two paths
$P_n$ and $P_m$. This paper determines that the exact value of $b(P_n\times
P_2)$, $b(P_n\times P_3)$ and $b(P_n\times P_4)$ for $n\ge 2$.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96193