Nima Ghanbari

activity

20142024

most citedMore on energy and Randic energy of specific graphs

1 citations · 2 across the 8 of their papers we have counts for

collaborators

4 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.CO2014★ 1 cited

More on energy and Randic energy of specific graphs

Saeid Alikhani, Nima Ghanbari

Let $G$ be a simple graph of order $n$ . The energy $E (G)$ of the graph $G$ is the sum of the absolute values of the eigenvalues of $G$ . The Randić matrix of $G$ , denoted by $R (G)$ ,…

math.CO2014★ 1 cited

Randic energy of specific graphs

Saeid Alikhani, Nima Ghanbari

Let $G$ be a simple graph with vertex set $V (G) = {v_{1}, v_{2}, ..., v_{n}}$ . The Randić matrix of $G$ , denoted by $R (G)$ , is defined as the $n \times n$ matrix whose $(i, j)$ -entry is $…