Nima Ghanbari

activity

20142026

most citedSombor Index of Polymers

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

collaborators

Showing 2021Show all

11 papers · 1 filter

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

More on co-even domination number

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

Co-even Domination Number of a Modified Graph by Operations on a Vertex or an Edge

Nima Ghanbari, Saeid Alikhani, Mohammad Ali Dehghanizadeh

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

Secure domination number of $k$ -subdivision of 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 Graovac-Ghorbani and atom-bond connectivity indices of graphs from primary subgraphs

Nima Ghanbari

Let $G = (V, E)$ be a finite simple graph. The Graovac-Ghorbani index of a graph G is defined as $ABC_{GG}(G)=\sum_{uv\in E(G)}\sqrt{\frac{n_u(uv,G)+n_v(uv,G)-2}{n_u(uv,G)n_v(uv,G)}},…

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$ …

math.CO2021★ 2 cited

Sombor index of certain graphs

Nima Ghanbari, Saeid Alikhani

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$ . In this…

math.CO2021

Enumeration of accurate dominating sets

Saeid Alikhani, Maryam Safazadeh, 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 number of isolate dominating sets of certain graphs

Nima Ghanbari, Saeid Alikhani

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…

Co-even domination number of some binary operations on graphs

More on co-even domination number

Co-even Domination Number of a Modified Graph by Operations on a Vertex or an Edge

Secure domination number of k-subdivision of graphs

On the Graovac-Ghorbani and atom-bond connectivity indices of graphs from primary subgraphs

On the Sombor characteristic polynomial and Sombor energy of a graph

Mostar index and edge Mostar index of polymers

Sombor Index of Polymers

Sombor index of certain graphs

Enumeration of accurate dominating sets

On the number of isolate dominating sets of certain graphs

Secure domination number of $k$ -subdivision of graphs