Nima Ghanbari

activity

20142026

most citedSombor Index of Polymers

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

collaborators

Showing 2022Show all

7 papers · 1 filter

math.CO2022

Strong domination number of a modified graph

Saeid Alikhani, Nima Ghanbari

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…

math.CO2022★ 1 cited

Super Domination: Graph Classes, Products and Enumeration

Nima Ghanbari, Gerold Jäger, Tuomo Lehtilä

The dominating set problem (DSP) is one of the most famous problems in combinatorial optimization. It is defined as follows. For a given simple graph $G = (V, E)$ , a dominating set of…

math.CO2022

Strong domination number of some operations on a graph

Saeid Alikhani, Nima Ghanbari, Hassan Zaherifar

Let $G = (V (G), E (G))$ be a simple graph. A set $D \subseteq 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 $xy\in…

math.CO2022

End Super Dominating Sets in Graphs

Saieed Akbari, Nima Ghanbari, Michael A. Henning

Let $G = (V, E)$ be a simple graph. A dominating set of $G$ is a subset $S \subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$ . The cardinality of…

math.CO2022

Sombor-index-like invariants of some graphs

Nima Ghanbari, Saeid Alikhani

The Sombor index (SO) is a vertex-degree-based graph invariant, defined as the sum over all pairs of adjacent vertices of $d_{i}^{2} + d_{j}^{2}$ , where $d_{i}$ is the degree of the $i$ …

math.CO2022★ 1 cited

Some results on the super domination number of a graph II

Nima Ghanbari

Let $G = (V, E)$ be a simple graph. A dominating set of $G$ is a subset $S \subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$ . The cardinality of…

math.CO2022

Some results on the super domination number of a graph

Nima Ghanbari

Let $G = (V, E)$ be a simple graph. A dominating set of $G$ is a subset $S \subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$ . The cardinality of…