10 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…
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…
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 .…
Stability of the Strong Domination Number of Graphs
Saeid Alikhani, Mazharuddin Mehraban, Hossein Shojaaldini Ardakani
This paper introduces and studies the stability of the strong domination number of a graph, denoted , defined as the minimum number of vertices whos…
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…
-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…