Nima Ghanbari

activity

20142026

most citedSombor Index of Polymers

11 citations · 27 across the 34 of their papers we have counts for

collaborators

Showing 2023Show all

4 papers · 1 filter

math.CO2023

Strong domination number of graphs from primary subgraphs

Saeid Alikhani, Nima Ghanbari, Michael A. Henning

A set $D$ of vertices is a strong dominating set in a graph $G$ , if for every vertex $x \in V (G) ∖ D$ there is a vertex $y \in D$ with $x y \in E (G)$ and $d e g (x) \leq d e g (y)$ .…

math.CO2023

Strong domatic number of a graph

Nima Ghanbari, Saeid Alikhani

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

math.CO2023

Computational complexity aspects of super domination

Csilla Bujtás, Nima Ghanbari, Sandi Klavžar

Let $G$ be a graph. A dominating set $D \subseteq V (G)$ is a super dominating set if for every vertex $x \in V (G) ∖ D$ there exists $y \in D$ such that $N_G(y)\cap (V(G)\setmi…

math.CO2023

Strong domination number of Hajós sum and vertex-sum of two graphs

Nima Ghanbari, Saeid Alikhani

Let $G = (V, E)$ be a simple graph. A set $D \subseteq V$ is a strong dominating set of $G$ , if for every vertex $x \in V ∖ D$ there is a vertex $y \in D$ with $x y \in E (G)$ and $d…