Partial Domination in Graphs

DOI10.1007/S40995-018-0618-5MaRDI QIDQ6289055zbMATH OpenFDO

Authors Angsuman Das

Publication date 16 July 2017

Full work available at URL https://doi.org/10.1007/S40995-018-0618-5

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: Let $G=(V,E)$ be a graph. For some $alpha$ with $0<alphaleq1$, a subset $S$ of $V$ is said to be a $alpha$-partial dominating set if $|N[S]|geqalpha|V|$. The size of a smallest such $S$ is called the $alpha$-partial domination number and is denoted by $mathsf{pd}_{a}lpha(G)$. In this paper, we introduce $alpha$-partial domination number in a graph $G$ and study different bounds on the partial domination number of a graph $G$ with respect to its order, maximum degree, domination number etc., Moreover, $alpha$-partial domination spectrum is introduced and Nordhaus-Gaddum bounds on the partial domination number are studied.

This page was built for publication: Partial Domination in Graphs

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