The 2-Domination and 2-Bondage Numbers of Grid Graphs

arXiv1204.4514MaRDI QIDQ6232464FDOQ6232464

Authors: You Lu, Jun-Ming Xu 

Publication date: 19 April 2012

Abstract: Let $p$ be a positive integer and $G=(V,E)$ be a simple graph. A subset $DsubseteqV$ is a $p$-dominating set if each vertex not in $D$ has at least $p$ neighbors in $D$. The $p$-domination number $g_p(G)$ is the minimum cardinality among all $p$-dominating sets of $G$. The $p$-bondage number $b_p(G)$ is the cardinality of a smallest set of edges whose removal from $G$ results in a graph with a $p$-domination number greater than the $p$-domination number of $G$. In this note we determine the 2-domination number $g_2$ and 2-bondage number $b_2$ for the grid graphs $G_{m,n}=P_{m}imes{P}_n$ for $2leqmleq4$.

This page was built for publication: The 2-Domination and 2-Bondage Numbers of Grid Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6232464)