# Irregular independence and irregular domination

## TL;DR

This paper introduces and studies the new graph parameters irregular independence and irregular domination, providing bounds, characterizations, and specific results for classes like planar and outerplanar graphs.

## Contribution

It defines the parameters, establishes bounds, and characterizes graphs with extremal values, advancing the understanding of irregular graph parameters.

## Key findings

- Sharp bounds for irregular independence and irregular domination in terms of basic graph parameters.
- Characterization of graphs with irregular independence number 1.
- Identification of irregular parameters for planar and outerplanar graphs.

## Abstract

If $A$ is an independent set of a graph $G$ such that the vertices in $A$ have different degrees, then we call $A$ an irregular independent set of $G$. If $D$ is a dominating set of $G$ such that the vertices that are not in $D$ have different numbers of neighbours in $D$, then we call $D$ an irregular dominating set of $G$. The size of a largest irregular independent set of $G$ and the size of a smallest irregular dominating set of $G$ are denoted by $\alpha_{ir}(G)$ and $\gamma_{ir}(G)$, respectively. We initiate the investigation of these two graph parameters. For each of them, we obtain sharp bounds in terms of basic graph parameters such as the order, the size, the minimum degree and the maximum degree, and we obtain Nordhaus-Gaddum-type bounds. We also establish sharp bounds relating the two parameters. Furthermore, we characterize the graphs $G$ with $\alpha_{ir}(G)=1$, we determine those that are planar, and we determine those that are outerplanar.