Darren Narayan

From MaRDI portal
(Redirected from Person:322048)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Failed zero forcing numbers of trees and circulant graphs
Theory and Applications of Graphs
2025-01-16Paper
Minimally non-asymmetric graphs and balanced incomplete block designs
Congressus Numerantium
2025-01-02Paper
Classroom notes: real-world examples of applications of vertex coloring and edge betweenness centrality
Bulletin of the Institute of Combinatorics and its Applications
2024-09-27Paper
Realizing the asymmetric index of a graph
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing
2024-08-13Paper
Characterization of Graphs With Failed Skew Zero Forcing Number of 12022-09-19Paper
Characterizing edge betweenness-uniform graphs
Theory and Applications of Graphs
2022-04-20Paper
All Graphs with a Failed Zero Forcing Number of Two2021-10-18Paper
Uniform edge betweenness centrality
Electronic Journal of Graph Theory and Applications
2021-09-06Paper
Infinite families of asymmetric graphs
AKCE International Journal of Graphs and Combinatorics
2021-09-01Paper
Classroom note: an application of edge clustering centrality to brain connectivity2020-09-01Paper
Edge-transitive graphs and combinatorial designs
Involve
2020-02-03Paper
scientific article; zbMATH DE number 7085089 (Why is no real title available?)2019-07-24Paper
Enumerating shortest paths and determining edge betweenness centrality in Cartesian products of paths and cycles2018-09-17Paper
Efficiency of star-like graphs and the Atlanta subway network
Physica A
2018-09-11Paper
The Asymmetric Index of a Graph2018-08-30Paper
Intersecting geodesics and centrality in graphs
Involve
2018-06-13Paper
scientific article; zbMATH DE number 6863841 (Why is no real title available?)2018-04-23Paper
Towards a characterization of graphs with distinct betweenness centralities2017-11-29Paper
A graph theoretic analysis of leverage centrality
AKCE International Journal of Graphs and Combinatorics
2017-11-17Paper
Greedy algorithms for generalized \(k\)-rankings of paths
Information Processing Letters
2017-11-03Paper
Leverage centrality of knight's graphs and Cartesian products of regular graphs and path powers
Involve
2017-04-03Paper
Flanking numbers and arankings of cyclic graphs2017-02-17Paper
Relationships Between Characteristic Path Length, Efficiency, Clustering Coefficients, and Graph Density2017-02-03Paper
Extrema property of the \(k\)-ranking of directed paths and cycles
AKCE International Journal of Graphs and Combinatorics
2016-10-14Paper
Classroom notes: using graph theory to analyze anatomical connectivity of the human brain2016-07-20Paper
Global efficiency of graphs
AKCE International Journal of Graphs and Combinatorics
2015-12-11Paper
Maximizing the number of edges in optimal \(k\)-rankings
AKCE International Journal of Graphs and Combinatorics
2015-12-11Paper
Real world graph efficiency2015-10-06Paper
Measuring brain connectivity2015-10-06Paper
Untangling the Tuition Exchange program network2015-10-06Paper
Classroom notes: betweenness centrality in fiber-optic networks2015-10-06Paper
scientific article; zbMATH DE number 6490115 (Why is no real title available?)2015-10-06Paper
scientific article; zbMATH DE number 6470731 (Why is no real title available?)2015-08-05Paper
Maximum minimal \(k\)-rankings of cycles.2014-11-25Paper
Preface
Involve
2014-07-29Paper
Optimal monitoring of networks
Congressus Numerantium
2014-01-03Paper
Minimal rankings of the Cartesian product \(K_n \square K_m\)
Discussiones Mathematicae. Graph Theory
2013-12-13Paper
A characterization of optimal \(k\)-rankings of paths and cycles2013-06-12Paper
Spanning trees and hierarchical networks2013-06-12Paper
scientific article; zbMATH DE number 6174782 (Why is no real title available?)2013-06-12Paper
Optimal matching of approvers to access requests2013-06-12Paper
Optimally routing data in fiber-optic networks with existing flow
Bulletin of the Institute of Combinatorics and its Applications
2012-10-06Paper
Max-optimal and sum-optimal labelings of graphs
Information Processing Letters
2012-03-09Paper
Intermediate minimal \(k\)-rankings of graphs2011-08-24Paper
Representation numbers and Prague dimensions for complete graphs minus a disjoint union of paths2011-08-24Paper
The birank number of a graph2011-07-13Paper
Maximum flow in fiber-optic networks2011-07-06Paper
An optimal \(k\)-ranking characterization of oriented paths and cycles2011-05-18Paper
Minimal \(k\)-rankings for prism graphs
Involve
2010-09-09Paper
Greedy rankings and arank numbers
Information Processing Letters
2010-08-20Paper
Representations for complete graphs minus a disjoint union of paths2010-06-17Paper
Minimal \(k\)-rankings and the rank number of \(P^2_n\)
Information Processing Letters
2010-06-16Paper
Maximum minimal rankings of oriented trees
Involve
2009-11-13Paper
A classification of tournaments having an acyclic tournament as a minimum feedback arc set
Information Processing Letters
2009-08-27Paper
scientific article; zbMATH DE number 5572980 (Why is no real title available?)2009-06-30Paper
Powers of directed Hamiltonian paths as feedback arc sets2009-04-14Paper
Classroom Capsules
The College Mathematics Journal
2008-07-02Paper
On the reversing number of powers of directed Hamiltonian paths2008-02-22Paper
scientific article; zbMATH DE number 5237332 (Why is no real title available?)2008-02-20Paper
Representations of split graphs, their complements, stars, and hypercubes2007-02-16Paper
Representations of split graphs, their complements, stars, and hypercubes2007-02-16Paper
Minimal rankings and the arank number of a path
Discrete Mathematics
2006-09-14Paper
scientific article; zbMATH DE number 2163293 (Why is no real title available?)2005-04-29Paper
scientific article; zbMATH DE number 2114681 (Why is no real title available?)2004-11-11Paper
scientific article; zbMATH DE number 2114469 (Why is no real title available?)2004-11-11Paper
Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set
Journal of Graph Theory
2004-02-03Paper
Fibonacci Determinants2003-12-16Paper
scientific article; zbMATH DE number 1990692 (Why is no real title available?)2003-10-13Paper
scientific article; zbMATH DE number 1990001 (Why is no real title available?)2003-10-12Paper
Tiling Large Rectangles2002-01-01Paper
The reversing number of a digraph; a disjoint union of directed stars
Congressus Numerantium
2001-09-23Paper
Representations of graphs modulo \(n\)
Discrete Mathematics
2000-12-03Paper


Research outcomes over time


This page was built for person: Darren Narayan