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 2026Show all

3 papers · 1 filter

math.CO2026

Super Coalition Number in Graphs

Saeid Alikhani, Nima Ghanbari

We introduce and investigate the structural properties of super coalition partitions in graphs, a novel direction that bridges cooperative resource deployment with rigid domination…

math.CO2026

The partition dimension and $k$ -domination number of a family of non-distance regular graph

Ali Zafari, Saeid Alikhani

A partition $Σ = {S_{1}, S_{2}, \dots, S_{k}}$ of the vertex set $V (G)$ is a resolving partition if every pair of distinct vertices in $G$ has a unique representation relative to $Σ$ . T…

math.CO2026

Stability of the Strong Domination Number of Graphs

Saeid Alikhani, Nima Ghanbari, Mazharuddin Mehraban +1

This paper introduces and studies the stability of the strong domination number of a graph, denoted $st_{γ_{s t}} (G)$ , defined as the minimum number of vertices whose…

Super Coalition Number in Graphs

The partition dimension and k-domination number of a family of non-distance regular graph

Stability of the Strong Domination Number of Graphs

The partition dimension and $k$ -domination number of a family of non-distance regular graph