1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2014
A Note on Signed k-Submatching in Graphs
S. Akbari, M. Dalirrooyfard, K. Ehsani +1
Let be a graph of order . For every , let denote the set of all edges incident with . A signed -submatching of is a function $f:E(G)\longrighta…
cs.DM2014
On the Decision Number of Graphs
S. Akbari, M. Dalirrooyfard, S. Davodpoor +2
Let be a graph. A good function is a function , satisfying , for each , where and…