Nasrin Soltankhah

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