February 9, 2023
Doost Ali Mojdeh

Doost Ali Mojdeh

Degree: Professor
Address: Department of Mathematics, University of Mazandaran, Babolsar, Iran
Education: Ph.D in Mathematics (Graph Theory and Combinatorics)
Phone: 011-35302448
Faculty: Faculty of Mathematical Sciences


Hop domination polynomial of graphs
Type Presentation
Hop dominating set, hop domination polynomial, graphs, Peterson graphs
Researchers Doost Ali Mojdeh (First researcher) , Azam Sadat Emadi (Second researcher)


Let G be a simple graph of order n. The hop domination polynomial of G is the polynomial Dh(G̦ x)=Σdh(G̦ i)xi|V(G)|i=γh(G), 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