Some families of graphs whose domination polynomials are unimodal

DOI10.7508/IJMSI.2017.01.006MaRDI QIDQ4593504zbMATH OpenOpenAlexFDO

Authors Saeid Alikhani, Somayeh Jahari

Publication date 22 November 2017

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

zbMATH Keywords

domination polynomialfamilyunimodal

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Abstract: Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G,x)=su{m}_{i=gamma(G)}^{n}d(G,i)x^i$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. It is conjectured that the domination polynomial of any graph is unimodal. In this paper we present some families of graphs whose domination polynomials are unimodal.

Recommendations

• More on the unimodality of domination polynomial of a graph
• On the unimodality of domination polynomials
• Connected domination polynomial of graphs
• The average domination polynomial of graphs is unimodal
• Introduction to domination polynomial of a graph.

Cited in

(6)

• The average domination polynomial of graphs is unimodal
• More on the unimodality of domination polynomial of a graph
• On the independent domination polynomial of a graph
• On the unimodality of domination polynomials
• Unimodality and monotonic portions of certain domination polynomials
• General position polynomials

This page was built for publication: Some families of graphs whose domination polynomials are unimodal

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