Nasrin Soltankhah | Academic Influence

Why Is Nasrin Soltankhah Influential?

According to Wikipedia, Nasrin Soltankhah is an Iranian politician who was a Vice President under Mahmoud Ahmadinejad from 2009 to 2013. Education Soltankhan received a Bachelor of Science in Mathematics , a Master of Science in Mathematics , and a PhD in Mathematics from Sharif University of Technology.

(See a Problem?)

Nasrin Soltankhah's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On the existence of (v, k, t) trades (1992) (16)
Results on Total Domination and Total Restrained Domination in Grid Graphs (2010) (13)
On directed trades (1995) (8)
On Total Dominating Sets in Graphs (2008) (7)
On defining sets of directed designs (1999) (7)
On the non-existence of some Steiner $t$-$(v,k)$ trades of certain volumes (2008) (7)
Smallest defining sets of super-simple 2 - (v, 4,1) directed designs (2012) (6)
Directed Quadruple Designs (1995) (6)
RP2: a high-performance data center network architecture using projective planes (2017) (5)
On the 3-way (v, k, 2) Steiner trades (2016) (5)
On the possible volume of three way trades (2013) (5)
On the existence of $d$-homogeneous $3$-way Steiner trades (2016) (4)
ON THE POSSIBLE VOLUME OF -( v; k; t ) TRADES (2014) (4)
The 3-way intersection problem for S(2, 4, v) designs (2013) (3)
The 3-Way Intersection Problem for Kirkman Triple Systems (2017) (3)
Super-simple 2-(v, 5, 1) directed designs and their smallest defining sets (2012) (3)
The intersection problem for 2-(v, 5, 1) directed block designs (2012) (2)
The minimum possible volume size of u-way (v, k, t) trades. (2019) (2)
On the Relationship Between the Zero Forcing Number and Path Cover Number for Some Graphs (2020) (2)
Restrained condition on double Roman dominating functions (2021) (2)
Smallest defining number of r-regular k-chromatic graphs: r 1 k (2006) (2)
INTERSECTIONS OF DIRECTED QUADRUPLE SYSTEMS (1995) (2)
Super-simple (v, 4, 2) directed designs and a lower bound for the minimum size of their defining set (2015) (2)
On the Total Domination Subdivision Numbers of Grid Graphs (2010) (2)
On the Biclique Cover of the Complete Graph (2013) (2)
A Note on d-Biclique Covers (2012) (2)
On the Volume of 3-Way Trades for Trees with up to Three Edges (2020) (1)
k-Forcing number for Cartesian product of some graphs (2021) (1)
A linear algebraic approach to directed designs (2001) (1)
On the Existence of d-Homogeneous $$\mu $$μ-Way (v, 3, 2) Steiner Trades (2019) (1)
The 3-way flower intersection problem for Steiner triple systems (2019) (1)
Some algebraic hyperstructures related to zero forcing sets and forcing digraphs (2019) (1)
The 3-Way Intersection Problem for Kirkman Triple Systems (2017) (1)
On defining numbers of k-chromatic k-regular graphs (2005) (1)
Super-simple $(v,5,2)$ directed designs and their smallest defining sets with its application in LDPC codes (2020) (0)
On the Volume of µ-way G-trade (2022) (0)
On the Relationship Between the Zero Forcing Number and Path Cover Number for Some Graphs (2020) (0)
RP2: a high-performance data center network architecture using projective planes (2017) (0)
On the possible volume of $\mu$-$(v,k,t)$ trades (2013) (0)
On the Volume of 3-Way Trades for Trees with up to Three Edges (2020) (0)
Total perfect codes, OO-irredundant and total subdivision in graphs (2016) (0)
The maximum number of Steiner triple systems with one parallel class in common (2017) (0)
A Completion of the Spectrum of 3-Way $(v,k,2)$ Steiner Trades (2020) (0)
Revisiting k-tuple Dominating Sets with Emphasis on Small Values of k (2021) (0)
Further results on outer independent $2$-rainbow dominating functions of graphs (2022) (0)
On the Biclique Cover of the Complete Graph (2014) (0)
Constructing regular graphs with smallest defining number (2008) (0)
On the spectrum of $r$-orthogonal Latin squares of different orders (2016) (0)
On defining numbers of circular complete graphs (2007) (0)

This paper list is powered by the following services:

Other Resources About Nasrin Soltankhah

en.wikipedia.org

What Schools Are Affiliated With Nasrin Soltankhah?

Nasrin Soltankhah is affiliated with the following schools: