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

6 papers · 1 filter

math.CO2023

Independent domination stability in graphs

Saeid Alikhani, Mazharodin Mehraban, Alexei Zakharov +1

A non-empty set $S \subseteq V (G)$ of the simple graph $G = (V (G), E (G))$ is an independent dominating set of $G$ if every vertex not in $S$ is adjacent with some vertex in $S$ and th…

math.CO2023

More on the $2$ -restricted optimal pebbling number

Saeid Alikhani, Fatemeh Aghaei

Let $G = (V, E)$ be a simple graph. A function $f : V \to N \cup {0}$ is called a configuration of pebbles on the vertices of $G$ and the weight of $f$ is $w(f)=\sum_{u…

math.CO2023

Strong domination number of graphs from primary subgraphs

Saeid Alikhani, Nima Ghanbari, Michael A. Henning

A set $D$ of vertices is a strong dominating set in a graph $G$ , if for every vertex $x \in V (G) ∖ D$ there is a vertex $y \in D$ with $x y \in E (G)$ and $d e g (x) \leq d e g (y)$ .…

math.CO2023

Strong domatic number of a graph

Nima Ghanbari, Saeid Alikhani

A set $D$ of vertices of a simple graph $G = (V, E)$ is a strong dominating set, if for every vertex $x \in D = V ∖ D$ there is a vertex $y \in D$ with $x y \in E (G)$ and…

math.CO2023

Connected coalitions in graphs

Saeid Alikhani, Davood Bakhshesh, Hamidreza Golmohammadi +1

The connected coalition in a graph $G = (V, E)$ consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$ , neither of which is a connected dominating set but whose union $V_{1}\cu…

math.CO2023

Strong domination number of Hajós sum and vertex-sum of two graphs

Nima Ghanbari, Saeid Alikhani

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…

Independent domination stability in graphs

More on the 2-restricted optimal pebbling number

Strong domination number of graphs from primary subgraphs

Strong domatic number of a graph

Connected coalitions in graphs

Strong domination number of Hajós sum and vertex-sum of two graphs

More on the $2$ -restricted optimal pebbling number