شماره ركورد كنفرانس :
4819
عنوان مقاله :
Hop domination polynomial of graphs
عنوان به زبان ديگر :
Hop domination polynomial of graphs
پديدآورندگان :
Mojdeh D. A. damojdeh@umz.ac.ir University of Mazandaran, Department of Mathematics , Emadi A. S. math_emadi2000@yahoo.com University of Mazandaran, Department of Mathematics
كليدواژه :
Hop dominating set , hop domination polynomial , graphs , Peterson graphs.
عنوان كنفرانس :
سومين همايش بين المللي تركيبيات، رمزنگاري و محاسبات
چكيده فارسي :
Let G be a simple graph of order n. The hop domination polynomial of G is the polynomial Dh(G̦ x) = ∑| iV=(γGh)(|G) dh(G̦ i)xi, where dh (G, i) is the number of hop dominating sets of G of size i and γh(G) is the hop domination number of G. In this paper we study Dh (G, x) of a graph. We classify many families of graphs by studying their hop domination polynomial.
چكيده لاتين :
Let G be a simple graph of order n. The hop domination polynomial of G is the polynomial Dh(G̦ x) = ∑| iV=(γGh)(|G) dh(G̦ i)xi, where dh (G, i) is the number of hop dominating sets of G of size i and γh(G) is the hop domination number of G. In this paper we study Dh (G, x) of a graph. We classify many families of graphs by studying their hop domination polynomial.
