\beta-Packing Sets in Graphs

MaRDI QIDQ6319760zbMATH OpenFDO

Authors Benjamin M. Case, Evan M. Haithcock, Renu C. Laskar

Publication date 31 May 2019

Abstract: A set $SsubseteqV$ is $alpha$-dominating if for all $vinV-S$, $|N(v)capS|geqalpha|N(v)|.$ The $alpha$-domination number of $G$ equals the minimum cardinality of an $alpha$-dominating set $S$ in $G$. Since being introduced by Dunbar, et al. in 2000, $alpha$-domination has been studied for various graphs and a variety of bounds have been developed. In this paper, we propose a new parameter derived by flipping the inequality in the definition of $alpha$-domination. We say a set $SsubsetV$ is a $$-packing set of a graph $G$ if $S$ is a proper, maximal set having the property that for all vertices $vinV-S$, $$ for some $$ The $$-packing number of $G$ ($$-pack($G$)) equals the maximum cardinality of a $$-packing set in $G$. In this research, we determine $$-pack($G$) for several classes of graphs, and we explore some properties of $$-packing sets. Keywords: $$-packing, $alpha$-domination, graph theory, graph parameters

This page was built for publication: $\beta$-Packing Sets in Graphs

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