# Lower Bounds on Nonnegative Signed Domination Parameters in Graphs

## TL;DR

This paper investigates lower bounds on nonnegative signed domination parameters in graphs, extending existing bounds and introducing new bounds for the nonnegative signed k-subdomination number based on graph order and degree sequence.

## Contribution

It extends known lower bounds on the nonnegative signed domination number and initiates the study of the nonnegative signed k-subdomination number with new bounds based on graph properties.

## Key findings

- Established sharp lower bounds for _s(G)
- Extended bounds to the nonnegative signed k-subdomination number
- Connected bounds to graph order and degree sequence

## Abstract

Let $1 \leq k \leq n$ be a positive integer. A {\em nonnegative signed $k$-subdominating function} is a function $f:V(G) \rightarrow \{-1,1\}$ satisfying $\sum_{u\in N_G[v]}f(u) \geq 0$ for at least $k$ vertices $v$ of $G$. The value $\min\sum_{v\in V(G)} f(v)$, taking over all nonnegative signed $k$-subdominating functions $f$ of $G$, is called the {\em nonnegative signed $k$-subdomination number} of $G$ and denoted by $\gamma^{NN}_{ks}(G)$. When $k=|V(G)|$, $\gamma^{NN}_{ks}(G)=\gamma^{NN}_s(G)$ is the {\em nonnegative signed domination number}, introduced in \cite{HLFZ}. In this paper, we investigate several sharp lower bounds of $\gamma^{NN}_s(G)$, which extend some presented lower bounds on $\gamma^{NN}_s(G)$. We also initiate the study of the nonnegative signed $k$-subdomination number in graphs and establish some sharp lower bounds for $\gamma^{NN}_{ks}(G)$ in terms of order and the degree sequence of a graph $G$.