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

3 papers · 1 filter

math.CO2013

The edge cover polynomials of cubic graphs of order 10

Saeid Alikhani, Somayeh Jahari

Let $G$ be a simple graph of order $n$ and size $m$ . The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge…

math.CO2013

Final title: "More on domination polynomial and domination root" Previous title: "Graphs with domination roots in the right half-plane"

Saeid Alikhani, Emeric Deutsch

Let $G$ be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x) =\sum d(G, i)x^i, where d(G,i) is the number of dominating sets of G of size i. Every…

math.CO2013

Independent sets of some graphs associated to commutative rings

Saeid Alikhani, Saeed Mirvakili

Let $G = (V, E)$ be a simple graph. A set $S \subseteq V$ is independent set of $G$ , if no two vertices of $S$ are adjacent. The independence number $α (G)$ is the size of a maximum ind…