Darren Narayan

Dr. Darren Narayan

School of Mathematical Sciences, Rochester Institute of Technology, Rochester, NY, USA

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 March 2018 in Social Network Analysis and Mining
Verified
Journal Article
Closed access
PDF file
ASAlexander Strang
Alexander Strang
OHOliver Haynes
Oliver Haynes
NCNathan D. Cahill
Nathan D. Cahill
DNDarren Narayan
Darren Narayan

11 July 2013 in Physica A: Statistical Mechanics and its Applications
Verified
Journal Article
Closed access
BEBryan Ek
Bryan Ek
CVCaitlin VerSchneider
Caitlin VerSchneider
DNDarren Narayan
Darren Narayan

16 January 2009 in Information Processing Letters
Verified
Journal Article
Closed access
SNSarah Novotny
Sarah Novotny
JOJuan Ortiz
Juan Ortiz
DNDarren Narayan
Darren Narayan

20 November 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
LGLuis Gomez
Luis Gomez
KRKarla Jessica Rubi
Karla Jessica Rubi
JTJorden Terrazas
Jorden Terrazas
DNDarren Narayan
Darren Narayan
Given a graph G, the zero forcing number of G, Z(G), is the smallest cardinality of any set S of vertices on which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is: if a vertex v is in S, and exactly one neighbor u of v is not in S, then u is added to S in the next iteration. Zero forcing numbers have attracted great interest over the past 15 years and have been well studied. In this paper, we investigate the largest size of a set S that does not force all of the vertices in a graph to be in S. This quantity is known as the failed zero forcing number of a graph and will be denoted by F(G). We present new results involving this parameter. In particular, we completely characterize all graphs G where F(G)=2, solving a problem posed in 2015 by Fetcie, Jacob, and Saavedra.

1 December 2017 in AKCE International Journal of Graphs and Combinatorics
Verified
Journal Article
Open access
RVRoger Vargas
Roger Vargas
AWAbigail Waldron
Abigail Waldron
ASAnika Sharma
Anika Sharma
RFRigoberto Flórez
Rigoberto Flórez
DNDarren Narayan
Darren Narayan
In 2010, Joyce et al. defined the leverage centrality of vertices in a graph as a means to analyze functional connections within the human brain. In this metric a degree of a vertex is compared to ...

1 January 2024 in Theory and Applications of Graphs
Verified
Journal Article
Open access
PDF file
UAUniversity of Arkansas
University of Arkansas
LGLuis Gomez
Luis Gomez
KRKarla Jessica Rubi
Karla Jessica Rubi
CHCalifornia State University- Dominguez Hills
California State University- Dominguez Hills
JTJordan Terrazas
Jordan Terrazas
RTRochester Institute of Technology
Rochester Institute of Technology
Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule (described below) results in all vertices being in $S$. The forcing rule is as follows: if a vertex $v$ is in $S$, and exactly one neighbor $u$ of $v$ is not in $S$, then $u$ is added to $S$ in the next iteration. Zero forcing numbers have attracted great interest over the past 15 years and have been well studied. The zero forcing number is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by $G$. In this paper we investigate the largest size of a set $S$ that does not force all of the vertices in a graph to be in $S$. This property is known as the failed zero forcing number of a graph and will be denoted by $F(G)$. This property has been investigated in recent years, including a proof by Shitov that the determination of $F(G)$ is NP-complete. In this paper we present new results involving $F(G)$ for trees including a lower bound based on the independence number. In addition we develop new extremal methods and use them determine $F(G)$ for families of circulant graphs.