Darren A. Narayan, Ph.D.

Affiliations: 
2000 Lehigh University, Bethlehem, PA, United States 
Area:
Mathematics, Operations Research
Google:
"Darren Narayan"

Parents

Sign in to add mentor
Garth Isaak grad student 2000 Lehigh University
 (The reserving number of a digraph.)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Brewer A, Gregory A, Jones Q, et al. (2020) Infinite families of asymmetric graphs Akce International Journal of Graphs and Combinatorics. 1-10
Carter E, Ek B, Gonzalez D, et al. (2019) Intersecting geodesics and centrality in graphs Involve, a Journal of Mathematics. 12: 31-43
Newman HA, Miranda H, Gregory A, et al. (2019) Edge-transitive graphs and combinatorial designs Involve, a Journal of Mathematics. 12: 1329-1341
Strang A, Haynes O, Cahill ND, et al. (2018) Generalized relationships between characteristic path length, efficiency, clustering coefficients, and density Social Network Analysis and Mining. 8: 14
Vargas R, Waldron A, Sharma A, et al. (2017) Leverage centrality of knight’s graphs and Cartesian products of regular graphs and path powers Involve, a Journal of Mathematics. 10: 583-592
Vargas R, Waldron A, Sharma A, et al. (2017) A graph theoretic analysis of leverage centrality Akce International Journal of Graphs and Combinatorics. 14: 295-306
Swart BB, Flórez R, Narayan DA, et al. (2016) Extrema property of the k-ranking of directed paths and cycles Akce International Journal of Graphs and Combinatorics. 13: 38-53
Vargas R, Garcea F, Mahon BZ, et al. (2016) Refining the clustering coefficient for analysis of social and neural network data Social Network Analysis and Mining. 6
Flórez R, Narayan DA. (2015) Maximizing the number of edges in optimal k-rankings Akce International Journal of Graphs and Combinatorics. 12: 32-39
Ek B, VerSchneider C, Narayan DA. (2015) Global efficiency of graphs Akce International Journal of Graphs and Combinatorics. 12: 1-13
See more...