Fatemeh Aghaei

activity

20232025

collaborators

5 papers

math.CO2025

$2$ -Restricted Optimal Pebbling Number of Some Graphs

Juma Gul Dehqan, Saeid Alikhani, Ali Delavar Khalafi +1

Let $G = (V, E)$ be a simple graph. A pebbling configuration on $G$ is a function $f : V \to N \cup {0}$ that assigns a non-negative integer number of pebbles to each v…

math.CO2024

Domination polynomial and total domination polynomial of zero-divisor graphs of commutative rings

Saeid Alikhani, Fatemeh Aghaei

The domination polynomial (the total domination polynomial) of a graph $G$ of order $n$ is the generating function of the number of dominating sets (total dominating sets) of $…

math.CO2024

Pebbling number of polymers

Fatemeh Aghaei, Saeid Alikhani

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 quantity $\vert f\vert=\sum_{u…

math.CO2024

More on graph pebbling number

Saeid Alikhani, Fatemeh Aghaei

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

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…

2-Restricted Optimal Pebbling Number of Some Graphs

Domination polynomial and total domination polynomial of zero-divisor graphs of commutative rings

Pebbling number of polymers

More on graph pebbling number

More on the 2-restricted optimal pebbling number

$2$ -Restricted Optimal Pebbling Number of Some Graphs

More on the $2$ -restricted optimal pebbling number