On the domination polynomials of non P4-free graphs

author

  • Saeid Alikhani
Abstract:

A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of non $P_4$-free graphs. Also, we pose a conjecture about domination roots of these kind of graphs.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

P4-domination in Minimal Imperfect Graphs

Numerous studies concerning the number and disposition of chordless paths on four vertices in graphs proved that there is a strong relation between these paths and the perfectness of graphs. In this paper, we further investigate this relation by introducing the notion of P4-domination and formulating two conjectures, which are used both to find an equivalent version of the Odd Pair Conjecture a...

full text

Some Families of Graphs whose Domination Polynomials are Unimodal

Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{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$. In this paper we present some families of graphs whose domination polynomials are unimodal.

full text

On the super domination number of graphs

The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...

full text

Domination and Total Domination on Asteroidal Triple-free Graphs

We present the first polynomial time algorithms for solving the NPcomplete graph problems DOMINATING SET and TOTAL DOMINATING SET when restricted to asteroidal triple-free graphs. We also present algorithms to compute a minimum cardinality dominating set and a minimum cardinality total dominating set on a large superclass of the asteroidal triple-free graphs, called DDP-graphs. These algorithms...

full text

some families of graphs whose domination polynomials are unimodal

let $g$ be a simple graph of order $n$. the domination polynomial of $g$ is the polynomial $d(g, x)=sum_{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$. in this paper we present some families of graphs whose domination polynomials are unimodal.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 8  issue None

pages  49- 55

publication date 2013-10

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023