default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDarren A. Narayan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j23]Luis Gomez, Karla Rubi, Jorden Terrazas, Darren A. Narayan:
All Graphs with a Failed Zero Forcing Number of Two. Symmetry 13(11): 2221 (2021)- 2020
- [j22]Heather Newman, Hector Miranda, Rigoberto Flórez, Darren A. Narayan:
Uniform edge betweenness centrality. Electron. J. Graph Theory Appl. 8(2): 265-300 (2020) - 2018
- [j21]Alexander Strang, Oliver Haynes, Rigoberto Flórez, Darren A. Narayan:
Enumerating shortest paths and determining edge betweenness centrality in cartesian products of paths and cycles. Bull. ICA 83: 29-51 (2018) - [j20]Alexander Strang
, Oliver Haynes, Nathan D. Cahill, Darren A. Narayan:
Generalized relationships between characteristic path length, efficiency, clustering coefficients, and density. Soc. Netw. Anal. Min. 8(1): 14 (2018) - 2017
- [j19]Ruth Lopez, Jacob Worrell, Henry Wickus, Rigoberto Flórez, Darren A. Narayan:
Towards a characterization of graphs with distinct betweenness centralities. Australas. J Comb. 68: 285-303 (2017) - [j18]Roger Vargas Jr., Abigail Waldron, Anika Sharma, Rigoberto Flórez, Darren A. Narayan:
A graph theoretic analysis of leverage centrality. AKCE Int. J. Graphs Comb. 14(3): 295-306 (2017) - [j17]Joy Lind, Frank Garcea, Bradford Z. Mahon, Roger Vargas Jr., Darren A. Narayan:
Classroom Note: An Application of Edge Clustering Centrality to Brain Connectivity. Bull. ICA 79: 108-115 (2017) - 2016
- [j16]Breeanne Baker Swart, Rigoberto Flórez, Darren A. Narayan, George L. Rudolph:
Extrema property of the k-ranking of directed paths and cycles. AKCE Int. J. Graphs Comb. 13(1): 38-53 (2016) - [j15]Roger Vargas Jr., Frank Garcea, Bradford Z. Mahon, Darren A. Narayan:
Refining the clustering coefficient for analysis of social and neural network data. Soc. Netw. Anal. Min. 6(1): 49:1-49:8 (2016) - 2015
- [j14]Bryan Ek, Caitlin VerSchneider, Darren A. Narayan:
Global efficiency of graphs. AKCE Int. J. Graphs Comb. 12(1): 1-13 (2015) - [j13]Rigoberto Flórez, Darren A. Narayan:
Maximizing the number of edges in optimal k-rankings. AKCE Int. J. Graphs Comb. 12(1): 32-39 (2015) - [j12]Bryan Ek, Caitlin VerSchneider, Nathan D. Cahill, Darren A. Narayan:
A comprehensive comparison of graph theory metrics for social networks. Soc. Netw. Anal. Min. 5(1): 37:1-37:7 (2015) - 2014
- [j11]Jobby Jacob, Darren A. Narayan, Peter Richter, Emily Sergel, Anh Tran:
Rank numbers for bent ladders. Discuss. Math. Graph Theory 34(2): 309-329 (2014) - 2013
- [j10]Victor Kostyuk, Darren A. Narayan:
Maximum Minimal k-rankings of Cycles. Ars Comb. 111: 13-31 (2013) - 2012
- [j9]Gilbert Eyabi, Jobby Jacob, Renu C. Laskar, Darren A. Narayan, Dan Pillone:
Minimal rankings of the Cartesian product Kn\Box Km. Discuss. Math. Graph Theory 32(4): 725-735 (2012) - [j8]Robert E. Jamison, Darren A. Narayan:
Max-optimal and sum-optimal labelings of graphs. Inf. Process. Lett. 112(1-2): 26-31 (2012) - 2010
- [j7]Andrew Zemke, Sandra James, Darren A. Narayan:
Greedy algorithms for generalized k-rankings of paths. Inf. Process. Lett. 110(22): 979-985 (2010) - 2009
- [j6]Sarah Novotny, Juan Ortiz, Darren A. Narayan:
Minimal k. Inf. Process. Lett. 109(3): 193-198 (2009) - [j5]Garth Isaak, Robert E. Jamison, Darren A. Narayan:
Greedy rankings and arank numbers. Inf. Process. Lett. 109(15): 825-827 (2009) - 2006
- [j4]Victor Kostyuk, Darren A. Narayan, Victoria A. Williams:
Minimal rankings and the arank number of a path. Discret. Math. 306(16): 1991-1996 (2006) - 2004
- [j3]Garth Isaak, Darren A. Narayan:
A classification of tournaments having an acyclic tournament as a minimum feedback arc set. Inf. Process. Lett. 92(3): 107-111 (2004) - [j2]Garth Isaak, Darren A. Narayan:
Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set. J. Graph Theory 45(1): 28-47 (2004) - 2000
- [j1]Anthony B. Evans, Garth Isaak, Darren A. Narayan:
Representations of graphs modulo n. Discret. Math. 223(1-3): 109-123 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
