14 citations · 82 across the 98 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 1 cited
Graphs which their certain polynomials have few distinct roots- a survey
Saeid Alikhani
Let G = (V;E) be a simple graph. We consider domination polynomial, matching polynomial and edge cover polynomial of G. Graphs which their polynomials have few roots can give somet…
math.CO2011★ 9 cited
On the number of outer connected dominating sets of graphs
Saeid Alikhani, Mohammad H. Akhbari, C. Eslahchi +1
Let be a simple graph. A set is called an outer-connected dominating set (or ocd-set) of , if is a dominating set of and either or $…