I. I. Takhonov

collaborators

2 papers

math.CO2025

Total restrained coalitions in graphs

M. Chellali, J. C. Valenzuela-Tripodoro, H. Golmohammadi +2

A set $S \subseteq V$ in an isolate-free graph $G$ is a total restrained dominating set, abbreviated TRD-set, if every vertex in $V$ is adjacent to a vertex in $S$ , and every vertex…

math.CO2024

Strong coalitions in graphs

Hamidreza Golmohammadi, Saeid Alikhani, Nima Ghanbari +2

For a graph $G = (V, E)$ , a set $D \subset V (G)$ is a strong dominating set of $G$ , if for every vertex $x \in V (G) ∖ D$ there is a vertex $y \in D$ with $x y \in E (G)$ and $deg(x…