Domination polynomials of graph products

MaRDI QIDQ4977512zbMATH OpenFDO

Authors James Preen, Peter Tittmann, Tomer Kotek

Publication date 16 August 2017

Full work available at URL https://arxiv.org/abs/1305.1475

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Abstract: The domination polynomials of binary graph operations, aside from union, join and corona, have not been widely studied. We compute and prove recurrence formulae and properties of the domination polynomials of families of graphs obtained by various products, ranging from explicit formulae and recurrences for specific families to more general results. As an application, we show the domination polynomial is computationally hard to evaluate.

Recommendations

• On the domination polynomial of some graph operations
• scientific article; zbMATH DE number 6423767
• Recurrence relations and splitting formulas for the domination polynomial
• Introduction to domination polynomial of a graph.
• Forcing domination numbers of graphs under some binary operations

Cited in

(10)

• Some results on the independence polynomial of unicyclic graphs
• Graph products and integer domination
• Bipartition polynomials, the Ising model, and domination in graphs
• Graph operations and neighborhood polynomials
• On the roots of domination polynomial of graphs
• Graph products of the trivariate total domination polynomial and related polynomials
• Dichromatic polynomial of product digraphs
• scientific article; zbMATH DE number 7527867 (Why is no real title available?)
• Domination-related parameters in rooted product graphs
• Domination polynomials of some notable graph families

This page was built for publication: Domination polynomials of graph products

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