M. Dalirrooyfard

collaborators

2 papers

cs.DM2014

A Note on Signed k-Submatching in Graphs

S. Akbari, M. Dalirrooyfard, K. Ehsani +1

Let $G$ be a graph of order $n$ . For every $v \in V (G)$ , let $E_{G} (v)$ denote the set of all edges incident with $v$ . A signed $k$ -submatching of $G$ is a function $f:E(G)\longrighta…

cs.DM2014

On the Decision Number of Graphs

S. Akbari, M. Dalirrooyfard, S. Davodpoor +2

Let $G$ be a graph. A good function is a function $f : V (G) \to {- 1, 1}$ , satisfying $f (N (v)) \geq 1$ , for each $v \in V (G)$ , where $N (v) = {u \in V (G) ∣ uv \in E (G)}$ and…