M. Mehraban

collaborators

2 papers

math.CO2025

Independent domination bondage number in graphs

M. Mehraban, S. Alikhani

A non-empty set $S \subseteq V (G)$ of the simple graph $G = (V (G), E (G))$ is an independent dominating set of $G$ if every vertex not in $S$ is adjacent with some vertex in $S$ and th…

math.CO2023

Independent domination stability in graphs

Saeid Alikhani, Mazharodin Mehraban, Alexei Zakharov +1

A non-empty set $S \subseteq V (G)$ of the simple graph $G = (V (G), E (G))$ is an independent dominating set of $G$ if every vertex not in $S$ is adjacent with some vertex in $S$ and th…