Power domination polynomials of graphs

arXiv1805.10984MaRDI QIDQ6302201FDOQ6302201

Authors: Boris Brimkov, Rutvik Patel, Varun Suriyanarayana, Alexander Teich 

Publication date: 28 May 2018

Abstract: A power dominating set of a graph is a set of vertices that observes every vertex in the graph by combining classical domination with an iterative propagation process arising from electrical circuit theory. In this paper, we study the power domination polynomial of a graph $G$ of order $n$, defined as $mathcalP(G;x)=su{m}_{i=1}^{n}p(G;i)x^i$, where $p(G;i)$ is the number of power dominating sets of $G$ of size $i$. We relate the power domination polynomial to other graph polynomials, present structural and extremal results about its roots and coefficients, and identify some graph parameters it contains. We also derive decomposition formulas for the power domination polynomial, compute it explicitly for several families of graphs, and explore graphs which can be uniquely identified by their power domination polynomials.

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Power domination polynomials of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6302201)