Nasrin Soltankhah

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 13

Top Topics

Cartesian Product

Optimal Weights

Top Venues

Appl. Math. Comput.

Des. Codes Cryptogr.

RAIRO Oper. Res.

Publications

Azam Sadat Ahmadi, Nasrin Soltankhah, Babak Samadi
Limited packings: Related vertex partitions and duality issues. Appl. Math. Comput. 472 (2024)
Somayyeh Golalizadeh, Nasrin Soltankhah
On the codewords of generalized Reed-Muller codes reaching the fourth weight. Inf. Comput. 296 (2024)
Babak Samadi, Nasrin Soltankhah
Further results on outer independent 2-rainbow dominating functions of graphs. RAIRO Oper. Res. 57 (4) (2023)
Somayyeh Golalizadeh, Nasrin Soltankhah
On the fourth weight of generalized Reed-Muller codes. Des. Codes Cryptogr. 91 (12) (2023)
Babak Samadi, Nasrin Soltankhah, Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Doost Ali Mojdeh, Seyed Mahmoud Sheikholeslami, Juan Carlos Valenzuela Tripodoro
Restrained condition on double Roman dominating functions. Appl. Math. Comput. 438 (2023)
Zeinab Montazeri, Nasrin Soltankhah
k-Forcing number for Cartesian product of some graphs. Contributions Discret. Math. 16 (1) (2021)
Hanieh Amjadi, Nasrin Soltankhah
The 3-way flower intersection problem for Steiner triple systems. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
S. Golalizadeh, Nasrin Soltankhah
On the Existence of d-Homogeneous $$\mu $$ μ -Way (v, 3, 2) Steiner Trades. Graphs Comb. 35 (2) (2019)
Hanieh Amjadi, Nasrin Soltankhah
The 3-Way Intersection Problem for Kirkman Triple Systems. Graphs Comb. 33 (4) (2017)
Amir Hosein Kashefi, Leili Mohammad Khanli, Nasrin Soltankhah
RP2: a high-performance data center network architecture using projective planes. Clust. Comput. 20 (4) (2017)
M. Boostan, S. Golalizadeh, Nasrin Soltankhah
Super-simple (v, 4, 2) directed designs and a lower bound for the minimum size of their defining set. Discret. Appl. Math. 201 (2016)
Saeedeh Rashidi, Nasrin Soltankhah
On the 3-way (v, k, 2) Steiner trades. Discret. Math. 339 (12) (2016)
Farokhlagha Moazami, Nasrin Soltankhah
On the Biclique Cover of the Complete Graph. Graphs Comb. 31 (6) (2015)
Saeedeh Rashidi, Nasrin Soltankhah
On the possible volume of three way trades. Electron. Notes Discret. Math. 43 (2013)
Farzane Amirzade, Nasrin Soltankhah
Super-simple 2-(v, 5, 1) directed designs and their smallest defining sets. Australas. J Comb. 54 (2012)
Nasrin Soltankhah, Somaye Ahmadi
The intersection problem for 2-(v, 5, 1) directed block designs. Discret. Math. 312 (22) (2012)
Behnaz Omoomi, Nasrin Soltankhah
Constructing regular graphs with smallest defining number. Ars Comb. 91 (2009)
Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah
On defining numbers of circular complete graphs. Discret. Math. 307 (2) (2007)
Ebadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah
k. Ars Comb. 78 (2006)
Nasrin Soltankhah, Ebadollah S. Mahmoodian
On defining numbers of k-chromatic k-regular graphs. Ars Comb. 76 (2005)
Ebadollah S. Mahmoodian, Nasrin Soltankhah
A linear algebraic approach to directed designs. Australas. J Comb. 23 (2001)
Ebadollah S. Mahmoodian, Nasrin Soltankhah, Anne Penfold Street
On defining sets of directed designs. Australas. J Comb. 19 (1999)
Nasrin Soltankhah
On directed trades. Australas. J Comb. 11 (1995)
Ebadollah S. Mahmoodian, Nasrin Soltankhah
On the existence of (v, k, t) trades. Australas. J Comb. 6 (1992)