Title
Connected domination polynomial of graphs
Authors
Year of publication
2018
Published in
Article type
scientific article
Publication language
english
Keywords
EN
- connected domination polynomial
- graphs
- connected dominating set
- Petersen graphs
Abstract
EN Let G be a simple graph of order n. The connected domination polynomial of G is the polynomial Dc (G, x) = ∑i=γc(G)|V (G)| dc (G, i)xi, where dc (G, i) is the number of connected dominating sets of G of size i and γc (G) is the connected domination number of G. In this paper we study Dc (G, x) of any graph. We classify many families of graphs by studying their connected domination polynomial.
Pages (from - to)
103 - 121
License type
CC BY-NC-ND (attribution - noncommercial - no derivatives)
Full text of article
Access level to full text
public
Ministry points / journal
10
Ministry points / journal in years 2017-2021
10
System created by Poznań University of Technology
and Poznan Supercomputing and Networking Center
Log in through eKonto to add to SIS