Nima Ghanbari

activity

20162021

most citedSombor Index of Polymers

11 citations · 14 across the 10 of their papers we have counts for

collaborators

14 papers

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…

math.CO2021

Co-even domination number of some binary operations on graphs

Nima Ghanbari

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

math.CO2021

On the Sombor characteristic polynomial and Sombor energy of a graph

Nima Ghanbari

Let $G$ be a simple graph with vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ . The Sombor matrix of $G$ , denoted by $A_{S O} (G)$ , is defined as the $n \times n$ matrix whose $(i, j)$ -en…

math.CO2021

Mostar index and edge Mostar index of polymers

Nima Ghanbari, Saeid Alikhani

Let $G = (V, E)$ be a graph and $e = uv \in E$ . Define $n_{u} (e, G)$ be the number of vertices of $G$ closer to $u$ than to $v$ . The number $n_{v} (e, G)$ can be defined in an analogous way. Th…

math.CO2021★ 11 cited

Sombor Index of Polymers

Saeid Alikhani, Nima Ghanbari

Let $G = (V, E)$ be a finite simple graph. The Sombor index $S O (G)$ of $G$ is defined as $\sum_{uv \in E (G)} d_{u}^{2} + d_{v}^{2}$ , where $d_{u}$ is the degree of vertex $u$ in $G$ . Let $G$ …