14 citations · 82 across the 98 of their papers we have counts for
118 papers
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…
The partition dimension and -domination number of a family of non-distance regular graph
Ali Zafari, Saeid Alikhani
A partition of the vertex set is a resolving partition if every pair of distinct vertices in has a unique representation relative to . T…
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 , defined as the minimum number of vertices whose…
-Fair Coalitions in Graphs
Abbas Jafari, Saeid Alikhani
Let be a simple graph. A subset is called a -fair dominating set if every vertex not in has exactly neighbors in . Two disjoint sets $A, B…
Stability of -domination number of a graph
Mazharuddin Mehraban, Saeid Alikhani
This paper delves into the stability of the -domination number in simple undirected graphs. The -domination number of a graph , , represents the minimum size of a…
Fair coalition in graphs
Saeid Alikhani, Abbas Jafari, Maryam Safazadeh
Let be a simple graph. A dominating set of is a subset such that every vertex not in is adjacent to at least one vertex in . The cardinality of…