63 citations · 100 across the 13 of their papers we have counts for
14 papers
W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs
Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba
A set of a graph is called an outer-connected dominating set of if every vertex not in is adjacent to at least one vertex in , and the in…
On Mixed Domination in Generalized Petersen Graphs
M. Rajaati, M. R. Hooshmandasl, M. Alambardar Meybodi +1
Given a graph , a set of vertices and edges is called a mixed dominating set if every vertex and edge that is not included in happens to be a…
Domination Cover Number of Graphs
M. Alambardar Meybodi, M. R. Hooshmandasl, P. Sharifani +1
A set for the graph is called a dominating set if any vertex has at least one neighbor in . Fomin et al.[9] gave an algorithm for…
A note on belief structures and S-approximation spaces
Ali Shakiba, Amir Kafshdar Goharshady, MohammadReza Hooshmandasl +1
We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempster's multivalued mappings and lower and upper probabi…
On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
M. Hashemipour, M. R. Hooshmandasl, A. Shakiba
Let be a graph. A subset is a dominating set of if every vertex not in is adjacent to a vertex in . A set of a graph $G…
An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs
M. Rajaati, P. Sharifani, A. Shakiba +2
A mixed dominating set of a graph is a subset such that each element is adjacent or incident to at least one ele…
Some Results on [1, k]-sets of Lexicographic Products of Graphs
P. Sharifani, M. R. Hooshmandasl
A subset in a graph is called a -set, if for every vertex , . The -domination numbe…
On outer-connected domination for graph products
M. Hashemipour, M. R. Hooshmandasl, A. Shakiba
An outer-connected dominating set for an arbitrary graph is a set such that is a dominating set and the induced subgraph $G [V \setminus \ti…
A Linear Algorithm for Computing -set in Generalized Series-Parallel Graphs
P. Sharifani, M. R. Hooshmandasl
For a graph , a set is a -set if it is a dominating set for and each vertex is dominated by at most two vertices of , i…
An Explicit Construction of Optimal Dominating Sets in Grid
P. Sharifani, M. R. Hooshmandasl, M. Alambardar Meybodi
A dominating set in a graph is a subset of vertices such that every vertex in is a neighbor of some vertex of . The domination number of is the minimu…
On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
M. Rajaati, M. R. Hooshmandasl, M. J. Dinneen +1
A mixed dominating set for a graph is a set such that every element is either adjacent or incident to an element o…
A combinatorial approach to certain topological spaces based on minimum complement S-approximation spaces
M. R. Hooshmandasl, M. Alambardar Meybodi, A. K. Goharshady +1
An S-approximation space is a novel approach to study systems with uncertainty that are not expressible in terms of inclusion relations. In this work, we further examined these spa…
Entanglement dynamics and position-momentum entropic uncertainty relation of a -type three-level atom interacting with a two-mode cavity field in the presence of nonlinearities
M J Faghihi, M K Tavassoly, M R Hooshmandasl
In this paper, the interaction between a -type three-level atom and two-mode cavity field is discussed. The detuning parameters and cross-Kerr nonlinearity are taken into accoun…
On the quantum information entropies and squeezing associated with the eigenstates of isotonic oscillator
A Ghasemi, M R Hooshmandasl, M K Tavassoly
In this paper we calculate the position and momentum space information entropies for the quantum states associated with a particular physical system, i.e. the isotonic oscillator H…