Recurrence relations and splitting formulas for the domination polynomial
From MaRDI portal
Publication:456395
zbMath1252.05164arXiv1206.5926MaRDI QIDQ456395
James Preen, Peter Tittmann, Frank Simon, Martin Trinks, Tomer Kotek
Publication date: 24 October 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.5926
Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (24)
On the roots of domination polynomial of graphs ⋮ Harary polynomials ⋮ Graph operations and neighborhood polynomials ⋮ More on the unimodality of domination polynomial of a graph ⋮ On the unimodality of domination polynomials ⋮ Note on the subgraph component polynomial ⋮ Unimodality and monotonic portions of certain domination polynomials ⋮ On the number of fair dominating sets of graphs ⋮ Unnamed Item ⋮ Counting Minimal Dominating Sets ⋮ Domination polynomials of \(k\)-tree related graphs ⋮ The zero forcing polynomial of a graph ⋮ The average order of dominating sets of a graph ⋮ Some applications of Wagner's weighted subgraph counting polynomial ⋮ Graph polynomials for a class of DI-pathological graphs ⋮ Neighborhood and domination polynomials of graphs ⋮ The Domination Equivalence Classes of Paths ⋮ Domination polynomial of clique cover product of graphs ⋮ Number of dominating sets in cylindric square grid graphs ⋮ On the location of roots of graph polynomials ⋮ On the doubly connected domination polynomial of a graph ⋮ On the average order of a dominating set of a forest ⋮ Some families of graphs with no nonzero real domination roots ⋮ Domination Polynomials of certain hexagon lattice graphs
This page was built for publication: Recurrence relations and splitting formulas for the domination polynomial
