Site-wide links

Scholarly Works

Darren Narayan
Professor

2013 Submissions

Journal Paper

Ek, Bryan, et al. "Real World Graph Efficiency." Bulletin of the Institute of Combinatorics and Its Applications 69. September (2013): 47-59. Print. £

Lind, Joy and Darren A. Narayan. "Real World Graph Efficiency." Bulletin of the Institute of Combinatorics and Its Applications 69. September (2013): 14-24. Print. £

Cahill, Nathan D., Joy Lind, and Darren A. Narayan. "Measuring Brain Connectivity." Bulletin of the Institute of Combinatorics and Its Applications 69. September (2013): 68-78. Print. ∆

Kostyuk, Victor and Darren A. Narayan. "Maximum Minimal K-rankings of Cycles." Ars Combinatoria 111. (2013): 13-31. Print. £

Ek, Bryan, Caitlin VerSchneider, and Darren A. Narayan. "Efficiency of Star-like Networks and the Atlanta Subway Network." Physica A 392. (2013): 5481-5489. Print. £

Bileschi, Maxwell, et al. "A Characterization of Optimal k-rankings of Paths and Cycles." Bulletin of the Institute of Combinatorics and Its Applications 67. (2013): 17-26. Print. £

Lind, Joy and Darren A. Narayan. "Spanning Trees and Hierarchical Networks." Bulletin of the Institute of Combinatorics and Its Applications 67. 1 (2013): 119-127. Print. £

Lind, Joy and Darren A. Narayan. "Page Ranking by Internet Search Engines." Bulletin of the Institute of Combinatorics and Its Applications 67. 1 (2013): 94-98. Print. £

Lind, Joy and Darren A. Narayan. "Optimal Matching of Approvers to Access Requests." Bulletin of the Institute of Combinatorics and Its Applications 67. 1 (2013): 99-103. Print. £

Dorff, Michael and Darren A. Narayan. "Obtaining Funding and Support for Undergraduate Research." PRIMUS 23. (2013): 776-784. Print. ∆ £

2012 Submissions

Journal Paper

Jamison, Robert E. and Darren A. Narayan. "Max-Optimal and Sum-Optimal Labelings of Graphs." Information Processing Letters (Elsevier Science) 112. 1-2 (2012): 26-31. Print. £

Invited Presentations/Keynotes

Narayan, Darren A. "Finding Funding and Support for Building an Undergraduate Research Program." 2012 Trends in Undergraduate Research in the Mathematical Sciences Conference. Mathematical Association of America. Chicago, IL. 28 Oct. 2012. Conference Presentation.

Narayan, Darren A. "Efficiency of Graphs." Fall Eastern Section Meeting, American Mathematical Society. Rochester Institute of Technology. Rochester, NY. 23 Sep. 2012. Conference Presentation.

2010 Submissions

Published Article

Narayan, D. A. et al. “Representation numbers for complete graphs minus a disjoint union of graphs.” Journal of Combinatorical Mathematics and Combinatorial Computing, 72 (2010), 173-180. Print. *

Narayan, Darren A. et al. “Minimal k-rankings of prism graphs”, Involve, 3:2 (2010): 183-190. Print. † ≠ *

Narayan, Darren A. et al. “Greedy algorithms for generalized rankings of graphs.” Information Processing Letters, 110 (2010): 979-985. Print. † ≠ *

Narayan, Darren A. “Maximum Flow in Fiber-Optic Networks.” Bulletin of the Institute of Combinatorics and Its Applications, 60 (September 2010): 91-96. Print. ≠ *

Adams, Sarah, R. Gillman, D. Narayan.”Balancing the R with the E in REU Programs.” Resources for Undergraduate Research, 6 (2010): n.p. Web. ≠

Formal Presentation

Narayan, Darren. “Mathematical Quips, Quotes, Rumors, and Humorous Tales” Spring 2010 Meeting of the Seaway Section of the Mathematical Association of America. Oswego, NY. April 2010. Presentation.

Narayan, Darren A. “Intermediate Ordered Colorings of Graphs.” AMS Session on Discrete Mathematics, VI, Joint Mathematics Meetings. San Francisco, CA. January 2010. Presentation.