Behnaz Omoomi

According to our database, Behnaz Omoomi authored at least 37 papers between 2001 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Fostering Peer Learning With a Game-Theoretical Approach in a Blended Learning Environment.

Seyede Fatemeh Noorani, Mohammad Hossein Manshaei, Mohammad Ali Montazeri, Behnaz Omoomi

IEEE Trans. Comput. Soc. Syst., 2022

2021

A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees.

Behnaz Omoomi, Elham Roshanbin, Marzieh Vahid Dastjerdi

Electron. J. Comb., 2021

Star Edge coloring of the Cartesian product of graphs.

Behnaz Omoomi, Marzieh Vahid Dastjerdi

Australas. J Comb., 2021

2019

Fostering Peer Learning through a New Game-Theoretical Approach in a Blended Learning Environment.

Seyede Fatemeh Noorani, Mohammad Hossein Manshaei, Mohammad Ali Montazeri, Behnaz Omoomi

CoRR, 2019

2018

Complexity reduction of throughput optimal link scheduling algorithm through topology control in wireless networks.

Ali Ghiasian, Behnaz Omoomi, Hossein Saidi

Int. J. Ad Hoc Ubiquitous Comput., 2018

Clique-coloring of Ks_{3, 3}-minor free graphs.

Behnaz Omoomi, Maryam Taleb

CoRR, 2018

2017

A characterization of some graphs with metric dimension two.

Ali Behtoei, Akbar Davoodi, Mohsen Jannesari, Behnaz Omoomi

Discret. Math. Algorithms Appl., 2017

2016

Local Clique Covering of Claw-Free Graphs.

Ramin Javadi, Zeinab Maleki, Behnaz Omoomi

J. Graph Theory, 2016

Pairwise balanced designs and sigma clique partitions.

Akbar Davoodi, Ramin Javadi, Behnaz Omoomi

Discret. Math., 2016

Critical Hamiltonian Connected Graphs.

Maliheh Modalleliyan, Behnaz Omoomi

Ars Comb., 2016

Characterization of Randomly k-Dimensional Graphs.

Mohsen Jannesari, Behnaz Omoomi

Ars Comb., 2016

Unique basis graphs.

Behrooz Bagheri Gh., Mohsen Jannesari, Behnaz Omoomi

Ars Comb., 2016

On incidence coloring for some graphs of maximum degree 4.

Hamed Fahimi, Behnaz Omoomi

Ars Comb., 2016

On the Locating Chromatic Number of the Cartesian Product of Graphs.

Ali Behtoei, Behnaz Omoomi

Ars Comb., 2016

2015

On the 1-2-3-conjecture.

Akbar Davoodi, Behnaz Omoomi

Discret. Math. Theor. Comput. Sci., 2015

EnHiC: An enforced hill climbing based system for general game playing.

Amin Babadi, Behnaz Omoomi, Graham Kendall

Proceedings of the 2015 IEEE Conference on Computational Intelligence and Games, 2015

2014

On the simultaneous edge coloring of graphs.

Behrooz Bagheri Gh., Behnaz Omoomi

Discret. Math. Algorithms Appl., 2014

2013

The impact of network topology on delay bound in wireless Ad Hoc networks.

Ali Ghiasian, Hossein Saidi, Behnaz Omoomi, Soodeh Amiri

Wirel. Networks, 2013

An Upper Bound for the Total Restrained Domination Number of Graphs.

Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi

Graphs Comb., 2013

Max-min total restrained domination number.

Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi

Ars Comb., 2013

On the total restrained domination edge critical graphs.

Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi

Ars Comb., 2013

2012

The metric dimension of the lexicographic product of graphs.

Mohsen Jannesari, Behnaz Omoomi

Discret. Math., 2012

On construction of involutory MDS matrices from Vandermonde Matrices in GF(2 q ).

Mahdi Sajadieh, Mohammad Dakhilalian, Hamid Mala, Behnaz Omoomi

Des. Codes Cryptogr., 2012

A generalization of line graphs via link scheduling in wireless networks

Ali Ghiasian, Behnaz Omoomi, Hossein Saidi

CoRR, 2012

On b-coloring of cartesian product of graphs.

Ramin Javadi, Behnaz Omoomi

Ars Comb., 2012

2011

On the locating chromatic number of Kneser graphs.

Ali Behtoei, Behnaz Omoomi

Discret. Appl. Math., 2011

On randomly k-dimensional graphs.

Mohsen Jannesari, Behnaz Omoomi

Appl. Math. Lett., 2011

2009

On b-coloring of the Kneser graphs.

Ramin Javadi, Behnaz Omoomi

Discret. Math., 2009

Constructing regular graphs with smallest defining number.

Behnaz Omoomi, Nasrin Soltankhah

Ars Comb., 2009

A note on the P-time algorithms for solving the maximum independent set problem.

Navid Nasr Esfahani, Parisa Mazrooei, Kaveh Mahdaviani, Behnaz Omoomi

Proceedings of the 2nd Conference on Data Mining and Optimization, 2009

2008

Local coloring of Kneser graphs.

Behnaz Omoomi, Ali Pourmiri

Discret. Math., 2008

On the Local Colorings of Graphs.

Behnaz Omoomi, Ali Pourmiri

Ars Comb., 2008

2006

Smallest defining number of r-regular k-chromatic graphs: r ¹ k.

Ebadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah

Ars Comb., 2006

On the defining sets of some special graphs.

Ebadollah S. Mahmoodian, Behnaz Omoomi, Yee-Hock Peng

Australas. J Comb., 2006

2003

Chromatic equivalence classes of certain generalized polygon trees, III.

Behnaz Omoomi, Yee-Hock Peng

Discret. Math., 2003

Chromatic Equivalence Classes of Certain Generalized Polygon Trees, II.

Behnaz Omoomi, Yee-Hock Peng

Ars Comb., 2003

2001

Chromatic equivalence classes of certain cycles with edges.

Behnaz Omoomi, Yee-Hock Peng

Discret. Math., 2001