Hop domination polynomial of graphs. (18th May 2020)

• Record Type: Journal Article
• Authors: Mojdeh, D. A.; Emadi, A. S.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 23:Number 4(2020)
• Page Start: 825
• Page End: 840
• Publication Date: 2020-05-18
• Subjects: 05C69 -- 11B83; Hop dominating set -- hop domination polynomial -- graphs -- Petersen graphs -- generalized Petersen graph; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2019.1621493
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: Let G be a simple graph of order n . The hop domination polynomial of G is the polynomial, where d h ( 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 d h ( G, i ) of a graph. We classify many families of graphs by studying their hop domination polynomial.