ليست مقالات

Published Papers:

  1. Seyede Fatemeh Noorani, Mohammad Hossein Manshaei, Mohammad Ali Montazeri, Behnaz Omoomi, Fostering Peer Learning with a Game-Theoretical Approach in a Blended Learning Environment, IEEE Transactions on Computational Social Systems, doi: 10.1109/TCSS.2021.
  2. Behnaz Omoomi, Marziyeh Vahid  Dastjerdi and  Yasaman Yektaeian, Star edge coloring of Cactus graphs,  Iranian Journal of Science and Technology, Transactions A: Science, https://doi.org/10.1007/s40995-020-00829-z, 2020. pdf
  3. Behnaz Omoomi and Maryam Taleb, Clique-coloring of K3, 3-minor free graphs, Bulletin of the Iranian Mathematical Society, https://doi.org/10.1007/s41980-019-00341-0, 2019. .pdf
  4. Mahsa Mozafari-Nia and Behnaz Omoomi, Injective chromatic number of outer planar graphs, Taiwanese Journal of Mathematics 22 (6), 1309-1320, 2018. .pdf
  5. Ali Ghiasian, Hussein Saidi and Behnaz Omoomi,  Complexity Reduction of Throughput Optimal Link Scheduling Algorithm through Topology Control in Wireless Networks. International Journal of Ad Hoc and Ubiquitous Computing. 27 (11), 69-79, 2017.
  6. Ali Behtoei, Akbar Davoodi, Mohsen Jannesari, and Behnaz Omoomi. A characterization of some graphs with metric dimension two, 9(2), 2017, DOI:0.1142/S17938309175002764.  Discrete Mathematics, Algorithms and Applications, pdf.
  7. Zeinab Maleki and Behnaz Omoomi, Some lower bounds for the L-intersection number of graphs, 43(1): 69-78, 2017. Bulletin of Iranian Mathematical Society.  .pdf
  8. Behnaz Omoomi and Elham Roshanbin, Star coloring and tree-width of Kneser graph KG(n; 2), March,  2017. Utilitas Mathematica. pdf
  9. Mohsen Janesari and Behnaz Omoomi, Characterization of randomly k-dimensional graphs, 127: 357-372, 2016. Ars Combinatoria. pdf
  10. Behrouz Bagheri, Mohsen Janesari and Behnaz Omoomi,Uniquely dimensional graphs, Ars Combinatoria, 129: 249-259, 2016. pdf
  11. Akbar Davoodi, Ramin Javadi and Behnaz Omoomi, Edge clique covering sum of graphs, Acta Math. Hungar. DOI: 10.1007/s10474-016-0586-1. .pdf
  12. Ali Behtoei and Behnaz Omoomi, On the locating chromatic number of the cartesian product of graphs, Ars Combinatoria.  126:221-235, 2016. .pdf
  13. Malihe Modalelian and Behnaz Omoomi, Critical Hamiltonian connected graphs,Ars Combinatoria. 126 :13-27, 2016. pdf
  14. Ramin Javadi, Zeinab Maleki and Behnaz Omoomi, Local clique covering of claw-free graphs, Journal of Graph Theory, 81(1), 92–104, 2016. .pdf
  15. Akbar Davoodi, Ramin Javadi and Behnaz Omoomi, Pairwise balanced designs and sigma clique partitions, Discrete Mathematics,  339(5):1450–1458, 2016. pdf
  16. Behrouz Bagheri and Behnaz Omoomi, Small oriented cycle double cover of graphs,  Bulletin of the Malaysian Mathematical Sciences Society.  39(1): 219-225, 2016. pdf 
  17. Hamed Fahimi and Behnaz Omoomi, On incidence coloring for some graphs of maximum degree 4,  Ars Combinatoria.  125:33-45, 2016. .pdf
  18. Akbar Davoodi and Behnaz Omoomi, On the 1-2-3-conjecture, Discrete Mathematics and Theoretical Computer Sciences.  17(1): 67-78, 2015. pdf
  19. Behrouz Bagheri and Behnaz Omoomi, On the oriented perfect path double cover conjecture,  Bulletin of Iranian Mathematical Sciences.  41(1): 189-200, 2015. pdf
  20. Behrouz Bagheri and Behnaz Omoomi, On the simultaneous edge coloring of graphs, Discrete Mathematics, Algorithms and Applications. 6(4):1450049-1—1450049-16, 2014. pdf
  21. Toraj Shabanian, Massoud Reza Hashemi, Ahmad Askarian and Behnaz Omoomi, An Optimal Traffic Distribution Method Supporting End-to-End Delay Bound, Journal of computing and Security, 1(1): 61-71, 2014. .pdf
  22.  Mohsen Janesari and Behnaz Omoomi, Characterization of n-vertex graphs with metric‎‎ dimension n-3, Mathematica Bohemica. 139(1):1-23, 2014. pdf
  23. K.M. Koh, Zeinab Maleki and Behnaz Omoomi, Max-min total restrained domination number, Ars Combinatoria, 112:161-174, 2013. .pdf
  24. K.M. Koh, Zeinab Maleki and Behnaz Omoomi, On the total restrained domination edge critical graphs, Ars Combinatoria, 109:97-112, 2013. pdf
  25. K.M. Koh, Zeinab Maleki and Behnaz Omoomi, An upper bound for the total restrained domination number of graphs, Graphs and Combinatorics, 29:1443–1452, 2013. .pdf
  26. Ali Ghiasian, Hossein Saidi, Behnaz Omoomi and Soodeh Amiri, The impact of network topology on delay bound in wireless Ad Hoc networks, Wireless  Network, 19:237-24, 2013. .pdf
  27. Ramin Javadi and Behnaz Omoomi, On b-coloring of cartesian product of graphs, Ars Combinatoria, 107:521-536, 2012. pdf
  28. Mohsen Janesari and Behnaz Omoomi, The metric dimension of the lexicographic product of graphs, Discrete Mathematics, 312(22): 3349-3356, 2012. .pdf
  29. Mahdi Sajadieh, Mohamad Dakhilalian, Hamid Mala and Behnaz Omoomi, On construction of involutory MDS matrice from Vandermonde Matrices in GF(2q),  Des. Codes Cryptogr. 64:287–308, 2012.  pdf
  30. Mohsen Janesari and Behnaz Omoomi, On randomly k-dimentional graphs, Applied Mathematics Letters, 24: 1625-1629, 2011. .pdf
  31. Ali Behtoei and Behnaz Omoomi, On the locating chromatic number of Kneser graphs, Discrete Applied Mathematics, 159: 2214-2221, 2011. .pdf
  32. Ramin Javadi and Behnaz Omoomi, On b-coloring of Kneser graphs, Discrete Mathematics. 309: 4399-4408, 2009. .pdf 
  33. Behnaz Omoomi and Ali Pourmiri, Locally rainbow graphs, Utilitas Mathematica. 79: 267-275, 2009. .pdf
  34. Behnaz Omoomi and Nasrin Solatnkhah, Constructing regular graphs with smallest defining number, Ars Combinatoria, 91: 19-31, 2009. .pdf 
  35. Behnaz Omoomi and Ali Pourmiri, Local coloring of the Kneser graphs, Discrete Mathematics 308: 5922-5927, 2008. pdf 
  36. Behnaz Omoomi and Ali Pourmiri, On the local colorings of graphs, Ars Combinatoria, 86: 147-159, 2008. .pdf
  37. E.S. Mahmoodian, Behnaz Omoomi, and Y.H. Peng, On the defining sets of some special graphs. Australian Journal of Combinatorics, 35: 69-81, 2006. .pdf
  38. E.S. Mahmoodian, Behnaz Omoomi, and Nasrin Soltankhah, Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria, 78: 211-223, 2006. .pdf
  39. Behnaz Omoomi and Y.H. Peng, Chromatic equivalence classes of certain generalized polygon trees, III.Discrete Mathematics, 271:223-234, 2003. .pdf
  40. Behnaz Omoomi and Y.H. Peng, Chromatic equivalence classes of certain generalized polygon trees, II. Ars Combinatoria, 68:115-124, 2003. pdf
  41. Behnaz Omoomi and Y.H. Peng, Chromatic equivalence classes of certain cycles with edges. Discrete Mathematics, 232:175-183, 2001.  .pdf

 

page
https://people.iut.ac.ir/fa/bomoomi/%D9%84%D9%8A%D8%B3%D8%AA-%D9%85%D9%82%D8%A7%D9%84%D8%A7%D8%AA