Nasrin Soltankhah

According to our database, Nasrin Soltankhah authored at least 26 papers between 1992 and 2026.

Collaborative distances:

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

2026

On flag-transitive 2-designs with prime block length and projective special linear groups.

Mohsen Bayat, Nasrin Soltankhah

Des. Codes Cryptogr., January, 2026

2025

Uniquely proper distinguishing colorable graphs.

Meysam Korivand, Nasrin Soltankhah, Kazem Khashyarmanesh

Electron. J. Graph Theory Appl., 2025

2024

On the codewords of generalized Reed-Muller codes reaching the fourth weight.

Somayyeh Golalizadeh, Nasrin Soltankhah

Inf. Comput., January, 2024

Limited packings: Related vertex partitions and duality issues.

Azam Sadat Ahmadi, Nasrin Soltankhah, Babak Samadi

Appl. Math. Comput., 2024

2023

On the fourth weight of generalized Reed-Muller codes.

Somayyeh Golalizadeh, Nasrin Soltankhah

Des. Codes Cryptogr., December, 2023

Further results on outer independent 2-rainbow dominating functions of graphs.

Babak Samadi, Nasrin Soltankhah

RAIRO Oper. Res., July, 2023

Restrained condition on double Roman dominating functions.

Babak Samadi, Nasrin Soltankhah, Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Doost Ali Mojdeh, Seyed Mahmoud Sheikholeslami, Juan Carlos Valenzuela-Tripodoro

Appl. Math. Comput., 2023

2021

k-Forcing number for Cartesian product of some graphs.

Zeinab Montazeri, Nasrin Soltankhah

Contributions Discret. Math., 2021

2020

The 3-way flower intersection problem for Steiner triple systems.

Hanieh Amjadi, Nasrin Soltankhah

Discret. Math. Theor. Comput. Sci., 2020

2019

On the Existence of d-Homogeneous $$\mu $$ μ -Way (v, 3, 2) Steiner Trades.

Somayyeh Golalizadeh, Nasrin Soltankhah

Graphs Comb., 2019

2017

The 3-Way Intersection Problem for Kirkman Triple Systems.

Hanieh Amjadi, Nasrin Soltankhah

Graphs Comb., 2017

RP2: a high-performance data center network architecture using projective planes.

Amir Hosein Kashefi, Leili Mohammad Khanli, Nasrin Soltankhah

Clust. Comput., 2017

2016

On the 3-way (v, k, 2) Steiner trades.

Saeedeh Rashidi, Nasrin Soltankhah

Discret. Math., 2016

Super-simple (v, 4, 2) directed designs and a lower bound for the minimum size of their defining set.

M. Boostan, Somayyeh Golalizadeh, Nasrin Soltankhah

Discret. Appl. Math., 2016

2015

On the Biclique Cover of the Complete Graph.

Farokhlagha Moazami, Nasrin Soltankhah

Graphs Comb., 2015

2013

On the possible volume of three way trades.

Saeedeh Rashidi, Nasrin Soltankhah

Electron. Notes Discret. Math., 2013

2012

The intersection problem for 2-(v, 5, 1) directed block designs.

Nasrin Soltankhah, Somaye Ahmadi

Discret. Math., 2012

Super-simple 2-(v, 5, 1) directed designs and their smallest defining sets.

Farzane Amirzade, Nasrin Soltankhah

Australas. J Comb., 2012

2009

Constructing regular graphs with smallest defining number.

Behnaz Omoomi, Nasrin Soltankhah

Ars Comb., 2009

2007

On defining numbers of circular complete graphs.

Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah

Discret. Math., 2007

2006

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

Ebadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah

Ars Comb., 2006

2005

On defining numbers of k-chromatic k-regular graphs.

Nasrin Soltankhah, Ebadollah S. Mahmoodian

Ars Comb., 2005

2001

A linear algebraic approach to directed designs.

Ebadollah S. Mahmoodian, Nasrin Soltankhah

Australas. J Comb., 2001

1999

On defining sets of directed designs.

Ebadollah S. Mahmoodian, Nasrin Soltankhah, Anne Penfold Street

Australas. J Comb., 1999

1995

On directed trades.

Nasrin Soltankhah

Australas. J Comb., 1995

1992

On the existence of (v, k, t) trades.

Ebadollah S. Mahmoodian, Nasrin Soltankhah

Australas. J Comb., 1992