Darren A. Narayan

According to our database, Darren A. Narayan authored at least 23 papers between 2000 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2021

All Graphs with a Failed Zero Forcing Number of Two.

Luis Gomez, Karla Rubi, Jorden Terrazas, Darren A. Narayan

Symmetry, 2021

2020

Uniform edge betweenness centrality.

Heather Newman, Hector Miranda, Rigoberto Flórez, Darren A. Narayan

Electron. J. Graph Theory Appl., 2020

2018

Generalized relationships between characteristic path length, efficiency, clustering coefficients, and density.

Alexander Strang, Oliver Haynes, Nathan D. Cahill, Darren A. Narayan

Soc. Netw. Anal. Min., 2018

Enumerating shortest paths and determining edge betweenness centrality in cartesian products of paths and cycles.

Alexander Strang, Oliver Haynes, Rigoberto Flórez, Darren A. Narayan

Bull. ICA, 2018

2017

Classroom Note: An Application of Edge Clustering Centrality to Brain Connectivity.

Joy Lind, Frank Garcea, Bradford Z. Mahon, Roger Vargas Jr., Darren A. Narayan

Bull. ICA, 2017

A graph theoretic analysis of leverage centrality.

Roger Vargas Jr., Abigail Waldron, Anika Sharma, Rigoberto Flórez, Darren A. Narayan

AKCE Int. J. Graphs Comb., 2017

Towards a characterization of graphs with distinct betweenness centralities.

Ruth Lopez, Jacob Worrell, Henry Wickus, Rigoberto Flórez, Darren A. Narayan

Australas. J Comb., 2017

2016

Refining the clustering coefficient for analysis of social and neural network data.

Roger Vargas Jr., Frank Garcea, Bradford Z. Mahon, Darren A. Narayan

Soc. Netw. Anal. Min., 2016

Extrema property of the k-ranking of directed paths and cycles.

Breeanne Baker Swart, Rigoberto Flórez, Darren A. Narayan, George L. Rudolph

AKCE Int. J. Graphs Comb., 2016

2015

A comprehensive comparison of graph theory metrics for social networks.

Bryan Ek, Caitlin VerSchneider, Nathan D. Cahill, Darren A. Narayan

Soc. Netw. Anal. Min., 2015

Maximizing the number of edges in optimal k-rankings.

Rigoberto Flórez, Darren A. Narayan

AKCE Int. J. Graphs Comb., 2015

Global efficiency of graphs.

Bryan Ek, Caitlin VerSchneider, Darren A. Narayan

AKCE Int. J. Graphs Comb., 2015

2014

Rank numbers for bent ladders.

Jobby Jacob, Darren A. Narayan, Peter Richter, Emily Sergel, Anh Tran

Discuss. Math. Graph Theory, 2014

2013

Maximum Minimal k-rankings of Cycles.

Victor Kostyuk, Darren A. Narayan

Ars Comb., 2013

2012

Max-optimal and sum-optimal labelings of graphs.

Robert E. Jamison, Darren A. Narayan

Inf. Process. Lett., 2012

Minimal rankings of the Cartesian product <i>K_n\Box K_m</i>.

Gilbert Eyabi, Jobby Jacob, Renu C. Laskar, Darren A. Narayan, Dan Pillone

Discuss. Math. Graph Theory, 2012

2010

Greedy algorithms for generalized k-rankings of paths.

Andrew Zemke, Sandra James, Darren A. Narayan

Inf. Process. Lett., 2010

2009

Minimal k.

Sarah Novotny, Juan Ortiz, Darren A. Narayan

Inf. Process. Lett., 2009

Greedy rankings and arank numbers.

Garth Isaak, Robert E. Jamison, Darren A. Narayan

Inf. Process. Lett., 2009

2006

Minimal rankings and the arank number of a path.

Victor Kostyuk, Darren A. Narayan, Victoria A. Williams

Discret. Math., 2006

2004

Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set.

Garth Isaak, Darren A. Narayan

J. Graph Theory, 2004

A classification of tournaments having an acyclic tournament as a minimum feedback arc set.

Garth Isaak, Darren A. Narayan

Inf. Process. Lett., 2004

2000

Representations of graphs modulo <i>n</i>.

Anthony B. Evans, Garth Isaak, Darren A. Narayan

Discret. Math., 2000