S. Alikhani

activity

20092026

most citedIntroduction to Domination Polynomial of a Graph

14 citations · 82 across the 98 of their papers we have counts for

collaborators

Showing 2022Show all

6 papers · 1 filter

math.CO2022★ 2 cited

Coalition of cubic graphs of order at most $10$

Saeid Alikhani, Hamid Reza Golmohammadi, Elena V. Konstantinova

The coalition in a graph $G$ consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$ , neither of which is a dominating set but whose union $V_{1} \cup V_{2}$ , is a dominating…

math.CO2022★ 2 cited

Introduction to total coalitions in graphs

Saeid Alikhani, Davood Bakhshesh, Hamidreza Golmohammadi

Let $G$ be a graph with vertex set $V$ . Two disjoint sets $V_{1}, V_{2} \subseteq V$ are called a total coalition in $G$ , if neither $V_{1}$ and $V_{2}$ is a total dominating set of $G$ but…

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

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

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.GM2022

A Minimum Doubly Resolving Set and Strong Resolving Set for the Crystal Cubic Carbon

Ali Zafari, Saeid Alikhani

The task of identifying resolving sets has been extensively studied due to its wide relevance in fields such as chemistry, robot navigation, combinatorial optimization, pattern rec…

Coalition of cubic graphs of order at most 10

Introduction to total coalitions in graphs

Strong domination number of a modified graph

Strong domination number of some operations on a graph

Sombor-index-like invariants of some graphs

A Minimum Doubly Resolving Set and Strong Resolving Set for the Crystal Cubic Carbon

Coalition of cubic graphs of order at most $10$