On the Decision Number of Graphs

MaRDI QIDQ6248710zbMATH OpenFDO

Authors S. Akbari, M. Dalirrooyfard, S. Davodpoor, K. Ehsani, R. Sherkati

Publication date 1 February 2014

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: Let $G$ be a graph. A good function is a function $f:V(G)ightarrow-1,1$, satisfying $f(N(v))geq1$, for each $vinV(G)$, where $N(v)=uinV(G),|,uvinE(G)$ and $f(S)=su{m}_{uinS}f(u)$ for every $SsubseteqV(G)$. For every cubic graph $G$ of order $n,$ we prove that $gamma(G)leqfrac5n7$ and show that this inequality is sharp. A function $f:V(G)ightarrow-1,1$ is called a nice function, if $f(N[v])le1$, for each $vinV(G)$, where $N[v]=vcupN(v)$. Define $$, where $f$ is a nice function for $G$. We show that $$ for every cubic graph $G$ of order $n$, which improves the best known bound $-fracn2$.

This page was built for publication: On the Decision Number of Graphs

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