13 citations · 53 across the 39 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
A New Upper Bound on Total Domination Number of Bipartite Graphs
Saieed Akbari, Pooyan Ehsani, Sahar Qajar +2
Let be a graph. A subset is called a total dominating set if every vertex of is adjacent to at least one vertex of . The total domination number, $…
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…