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

3 papers · 1 filter

math.CO2020

A graph related to Euler $ϕ$ function

Nima Ghanbari, Saeid Alikhani

Euler function $ϕ (n)$ is the number of positive integers less than $n$ and relatively prime to $n$ . Suppose that $ϕ^{1} (n) = ϕ (n)$ and $ϕ^{i} (n) = ϕ (ϕ^{i - 1} (n))$ . Let $A\subseteq \mathbb{N…

math.CO2020

On the edge chromatic vertex stability number of graphs

Saeid Alikhani, Mohammad R. Piri

For an arbitrary invariant $ρ (G)$ of a graph $G$ , the $ρ -$ vertex stability number $v s_{ρ} (G)$ is the minimum number of vertices of $G$ whose removal results in a graph $H \subseteq G$ …

math.CO2020

Introduction to dominated edge chromatic number of a graph

Mohammad R. Piri, Saeid Alikhani

We introduce and study the dominated edge coloring of a graph. A dominated edge coloring of a graph $G$ is a proper edge coloring of $G$ such that each color class is dominated by…

A graph related to Euler ϕ function

On the edge chromatic vertex stability number of graphs

Introduction to dominated edge chromatic number of a graph

A graph related to Euler $ϕ$ function