Darren A. Narayan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Darren A. Narayan has a total of 62 co-authors. Here are the top co-authors by number of shared publications:
- Rigoberto Flórez
The Citadel
4 shared publications - Rigoberto Flórez
Department of Mathematical Sciences, The Citadel, Charleston, SC 29409, USA
4 shared publications - Brendan Rooney
Department of Mathematics Brigham Young University Provo UT
3 shared publications - Aidan Johnson
Department of Mathematical Sciences, University of Delaware, Newark, DE 19716, USA
2 shared publications - Alejandra Brewer
Auburn University
2 shared publications - Andrew E. Vick
Department of Mathematical Sciences, Lee University, Cleveland, TN 37311, USA
2 shared publications
Latest Publications
- Open Access
- 27 November 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (23) , 3812
Asymptotics of Closeness Centralities of Graphs
Given a connected graph G with n vertices, the distance between two vertices is the number of edges in a shortest path connecting them. The sum of the distances in a graph G from a vertex v to all other vertices is denoted by . The closeness centrality of a vertex in a graph was defined by Bavelas to be and the closeness centrality of G is . We consider the asymptotic limit of as the number of vertices tends to infinity and provide an elegant and insightful proof of a 2025 result by Britz, Hu, Islam, and Tang, , using uniform convergence and Riemann sums. We applied the same technique for the union of a cycle and path and the union of a path and a complete graph. We prove that of all graphs, paths have the minimum closeness centrality. Next we show for any , there exists a sequence of graphs such that . In addition, we investigate the mean distance of a graph, and the normalized closeness centrality, . We verify a conjecture of Britz, Hu, Islam, and Tang that the set of products is dense in .- 27 November 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (23) , 3812
Open AccessAsymptotics of Closeness Centralities of Graphs
Given a connected graph G with n vertices, the distance between two vertices is the number of edges in a shortest path connecting them. The sum of the distances in a graph G from a vertex v to all other vertices is denoted by . The closeness centrality of a vertex in a graph was defined by Bavelas to be and the closeness centrality of G is . We consider the asymptotic limit of as the number of vertices tends to infinity and provide an elegant and insightful proof of a 2025 result by Britz, Hu, Islam, and Tang, , using uniform convergence and Riemann sums. We applied the same technique for the union of a cycle and path and the union of a path and a complete graph. We prove that of all graphs, paths have the minimum closeness centrality. Next we show for any , there exists a sequence of graphs such that . In addition, we investigate the mean distance of a graph, and the normalized closeness centrality, . We verify a conjecture of Britz, Hu, Islam, and Tang that the set of products is dense in . - Open Access
Maximal bipartite graphs with a unique minimum dominating set
In 2003, Fischermann et al. considered the maximum size of \textit{uniquely-dominatable} graphs, graphs whose dominating number is realized only by a unique dominating set. They conjectured a size bound and provide a general graph construction that shows the bound is tight \cite{Original_Paper}. In 2010, Shank and Fraboni prove Fischermann's bound is true when $γ= 2$ \cite{Shank_paper}. In this paper, we observe how Fischermann's bound changes if we impart a different restriction on a graph -- bipartiteness. We conjecture a bound on the maximum number of edges possible for uniquely-dominatable bipartite graphs. We provide constructions to demonstrate this bound is tight. We prove our bipartite bound is true for the $γ= 2$ and $n = 3γ$ cases. We also discuss perfect domination and how it relates to our extremal graph constructions. We provide constructions that meet both Fischermann's bound for all graphs and our bound for bipartite graphs respectively, both of which are perfectly dominated.Open AccessMaximal bipartite graphs with a unique minimum dominating set
In 2003, Fischermann et al. considered the maximum size of \textit{uniquely-dominatable} graphs, graphs whose dominating number is realized only by a unique dominating set. They conjectured a size bound and provide a general graph construction that shows the bound is tight \cite{Original_Paper}. In 2010, Shank and Fraboni prove Fischermann's bound is true when $γ= 2$ \cite{Shank_paper}. In this paper, we observe how Fischermann's bound changes if we impart a different restriction on a graph -- bipartiteness. We conjecture a bound on the maximum number of edges possible for uniquely-dominatable bipartite graphs. We provide constructions to demonstrate this bound is tight. We prove our bipartite bound is true for the $γ= 2$ and $n = 3γ$ cases. We also discuss perfect domination and how it relates to our extremal graph constructions. We provide constructions that meet both Fischermann's bound for all graphs and our bound for bipartite graphs respectively, both of which are perfectly dominated. - Open Access
- 28 October 2025
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 20 (2) , 508-523
The asymmetric index of a graph
A graph $G$ is asymmetric if its automorphism group is trivial. Asymmetric graphs were introduced by Erdős and Rényi (1963). They suggested the problem of starting with an asymmetric graph and removing some number $r$ of edges and/or adding some number $s$ of edges so that the resulting graph is nonasymmetric. Erdős and Rényi defined the degree of asymmetry of a graph to be the minimum value of $r+s$. In this paper, we define another property that measures how close a given nonasymmetric graph is to being asymmetric. We define the asymmetric index of a graph $G$, denoted $ai(G)$, to be the minimum of $r+s$ so that the resulting graph $G$ is asymmetric. We investigate the asymmetric index of both connected and disconnected graphs. We prove that for any nonnegative integer $k$, there exists a graph $G$ where $ai(G)=k$. We show that the asymmetric index of a cycle with at least six vertices is two, and provide a complete characterization of all possible pairs of edges that can be added to a cycle to create an asymmetric graph. In addition we determine the asymmetric index of paths, certain circulant graphs, Cartesian products involving paths and cycles, and bounds for complete graphs, and complete bipartite graphs.- 28 October 2025
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 20 (2) , 508-523
Open AccessThe asymmetric index of a graph
A graph $G$ is asymmetric if its automorphism group is trivial. Asymmetric graphs were introduced by Erdős and Rényi (1963). They suggested the problem of starting with an asymmetric graph and removing some number $r$ of edges and/or adding some number $s$ of edges so that the resulting graph is nonasymmetric. Erdős and Rényi defined the degree of asymmetry of a graph to be the minimum value of $r+s$. In this paper, we define another property that measures how close a given nonasymmetric graph is to being asymmetric. We define the asymmetric index of a graph $G$, denoted $ai(G)$, to be the minimum of $r+s$ so that the resulting graph $G$ is asymmetric. We investigate the asymmetric index of both connected and disconnected graphs. We prove that for any nonnegative integer $k$, there exists a graph $G$ where $ai(G)=k$. We show that the asymmetric index of a cycle with at least six vertices is two, and provide a complete characterization of all possible pairs of edges that can be added to a cycle to create an asymmetric graph. In addition we determine the asymmetric index of paths, certain circulant graphs, Cartesian products involving paths and cycles, and bounds for complete graphs, and complete bipartite graphs. - Open Access
- 24 March 2025
- Published by MDPI AG in AppliedMath
- Vol. 5 (2) , 32
Failed Skew Zero Forcing Numbers of Path Powers and Circulant Graphs
For a graph G, the zero forcing number of G, , is defined to be the minimum cardinality of a set S of vertices for which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is as follows: if a vertex v is in S, and exactly one neighbor u of v is not in S, then the vertex u is added to S in the subsequent iteration. Now, the failed zero forcing number of a graph is defined to be the maximum size of a set of vertices which does not force all of the vertices in the graph. A similar type of forcing is called skew zero forcing, which is defined so that if there is exactly one neighbor u of v that is not in S, then the vertex u is added to S in the next iteration. The key difference is that vertices that are not in S can force other vertices. The failed skew zero forcing number of a graph is denoted by . At its core, the problem we consider is how to identify the tipping point at which information or infection will spread through a network or a population. The graphs we consider are where computers/routers or people are arranged in a linear or circular formation with varying proximities for contagion. Here, we present new results for failed skew zero forcing numbers of path powers and circulant graphs. Furthermore, we found that the failed skew zero forcing numbers of these families form interesting sequences with increasing n.- 24 March 2025
- Published by MDPI AG in AppliedMath
- Vol. 5 (2) , 32
Open AccessFailed Skew Zero Forcing Numbers of Path Powers and Circulant Graphs
For a graph G, the zero forcing number of G, , is defined to be the minimum cardinality of a set S of vertices for which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is as follows: if a vertex v is in S, and exactly one neighbor u of v is not in S, then the vertex u is added to S in the subsequent iteration. Now, the failed zero forcing number of a graph is defined to be the maximum size of a set of vertices which does not force all of the vertices in the graph. A similar type of forcing is called skew zero forcing, which is defined so that if there is exactly one neighbor u of v that is not in S, then the vertex u is added to S in the next iteration. The key difference is that vertices that are not in S can force other vertices. The failed skew zero forcing number of a graph is denoted by . At its core, the problem we consider is how to identify the tipping point at which information or infection will spread through a network or a population. The graphs we consider are where computers/routers or people are arranged in a linear or circular formation with varying proximities for contagion. Here, we present new results for failed skew zero forcing numbers of path powers and circulant graphs. Furthermore, we found that the failed skew zero forcing numbers of these families form interesting sequences with increasing n. - Open Access
- 26 September 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (19) , 2994
Closeness Centrality of Asymmetric Trees and Triangular Numbers
The combinatorial problem in this paper is motivated by a variant of the famous traveling salesman problem where the salesman must return to the starting point after each delivery. The total length of a delivery route is related to a metric known as closeness centrality. The closeness centrality of a vertex v in a graph G was defined in 1950 by Bavelas to be , where is the sum of the distances from v to each of the other vertices (which is one-half of the total distance in the delivery route). We provide a real-world example involving the Metro Atlanta Rapid Transit Authority rail network and identify stations whose values are nearly identical, meaning they have a similar proximity to other stations in the network. We then consider theoretical aspects involving asymmetric trees. For integer values of k, we considered the asymmetric tree with paths of lengths that are incident to a center vertex. We investigated trees with different values of k, and for and , we established necessary and sufficient conditions for the existence of two vertices with identical values, which has a surprising connection to the triangular numbers. Additionally, we investigated asymmetric trees with paths incident to two vertices and found a sufficient condition for vertices to have equal values. This leads to new combinatorial proofs of identities arising from Pascal’s triangle.- 26 September 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (19) , 2994
Open AccessCloseness Centrality of Asymmetric Trees and Triangular Numbers
The combinatorial problem in this paper is motivated by a variant of the famous traveling salesman problem where the salesman must return to the starting point after each delivery. The total length of a delivery route is related to a metric known as closeness centrality. The closeness centrality of a vertex v in a graph G was defined in 1950 by Bavelas to be , where is the sum of the distances from v to each of the other vertices (which is one-half of the total distance in the delivery route). We provide a real-world example involving the Metro Atlanta Rapid Transit Authority rail network and identify stations whose values are nearly identical, meaning they have a similar proximity to other stations in the network. We then consider theoretical aspects involving asymmetric trees. For integer values of k, we considered the asymmetric tree with paths of lengths that are incident to a center vertex. We investigated trees with different values of k, and for and , we established necessary and sufficient conditions for the existence of two vertices with identical values, which has a surprising connection to the triangular numbers. Additionally, we investigated asymmetric trees with paths incident to two vertices and found a sufficient condition for vertices to have equal values. This leads to new combinatorial proofs of identities arising from Pascal’s triangle. - Open Access
- 1 January 2024
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 11 (1) , 5
Failed Zero Forcing Numbers of Trees and Circulant Graphs
Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule (described below) results in all vertices being in $S$. The forcing rule is as follows: if a vertex $v$ is in $S$, and exactly one neighbor $u$ of $v$ is not in $S$, then $u$ is added to $S$ in the next iteration. Zero forcing numbers have attracted great interest over the past 15 years and have been well studied. The zero forcing number is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by $G$. In this paper we investigate the largest size of a set $S$ that does not force all of the vertices in a graph to be in $S$. This property is known as the failed zero forcing number of a graph and will be denoted by $F(G)$. This property has been investigated in recent years, including a proof by Shitov that the determination of $F(G)$ is NP-complete. In this paper we present new results involving $F(G)$ for trees including a lower bound based on the independence number. In addition we develop new extremal methods and use them determine $F(G)$ for families of circulant graphs.- 1 January 2024
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 11 (1) , 5
Open AccessFailed Zero Forcing Numbers of Trees and Circulant Graphs
Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule (described below) results in all vertices being in $S$. The forcing rule is as follows: if a vertex $v$ is in $S$, and exactly one neighbor $u$ of $v$ is not in $S$, then $u$ is added to $S$ in the next iteration. Zero forcing numbers have attracted great interest over the past 15 years and have been well studied. The zero forcing number is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by $G$. In this paper we investigate the largest size of a set $S$ that does not force all of the vertices in a graph to be in $S$. This property is known as the failed zero forcing number of a graph and will be denoted by $F(G)$. This property has been investigated in recent years, including a proof by Shitov that the determination of $F(G)$ is NP-complete. In this paper we present new results involving $F(G)$ for trees including a lower bound based on the independence number. In addition we develop new extremal methods and use them determine $F(G)$ for families of circulant graphs. - Open Access
- 25 September 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (19) , 4068
An Inverse Approach for Finding Graphs with a Failed Zero Forcing Number of k
For a given a graph G, the zero forcing number of G, , is the smallest cardinality of any set S of vertices on which repeated applications of the forcing rule results in all vertices being included in S. The forcing rule is as follows: if a vertex v is in S, and exactly one neighbor u of v is not in S, then u is added to S in the next iteration. The failed zero forcing number of a graph was introduced by Fetcie, Jacob, and Saavedra and was defined as the cardinality of the largest set of vertices which fails to force all vertices in the graph. In 2021, Gomez et al. proved that there were exactly 15 graphs with a failed zero forcing number of two, but their proof was complicated, requiring the analysis of many graph families. We present an “inverse” approach where we start with a set of vertices S and then see which graphs have S as a maximum-sized failed zero forcing set. This results in not only a shorter proof but characterizes which graphs have a particular failed zero forcing set. In our proof, we characterize the graphs which have a failed zero forcing set S where , meaning considering all simple graphs of order two as induced subgraphs. This approach also has greater potential for characterizing graphs where since many general arguments on the structure of graphs are developed in this type of analysis and are applicable for failed zero forcing sets of any size.- 25 September 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (19) , 4068
Open AccessAn Inverse Approach for Finding Graphs with a Failed Zero Forcing Number of k
For a given a graph G, the zero forcing number of G, , is the smallest cardinality of any set S of vertices on which repeated applications of the forcing rule results in all vertices being included in S. The forcing rule is as follows: if a vertex v is in S, and exactly one neighbor u of v is not in S, then u is added to S in the next iteration. The failed zero forcing number of a graph was introduced by Fetcie, Jacob, and Saavedra and was defined as the cardinality of the largest set of vertices which fails to force all vertices in the graph. In 2021, Gomez et al. proved that there were exactly 15 graphs with a failed zero forcing number of two, but their proof was complicated, requiring the analysis of many graph families. We present an “inverse” approach where we start with a set of vertices S and then see which graphs have S as a maximum-sized failed zero forcing set. This results in not only a shorter proof but characterizes which graphs have a particular failed zero forcing set. In our proof, we characterize the graphs which have a failed zero forcing set S where , meaning considering all simple graphs of order two as induced subgraphs. This approach also has greater potential for characterizing graphs where since many general arguments on the structure of graphs are developed in this type of analysis and are applicable for failed zero forcing sets of any size. - Open Access
- 9 March 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (6) , 1322
Fixing Numbers of Point-Block Incidence Graphs
A vertex in a graph is referred to as fixed if it is mapped to itself under every automorphism of the vertices. The fixing number of a graph is the minimum number of vertices, when fixed, that fixes all of the vertices in the graph. Fixing numbers were first introduced by Laison and Gibbons, and independently by Erwin and Harary. Fixing numbers have also been referred to as determining numbers by Boutin. The main motivation is to remove all symmetries from a graph. A very simple application is in the creation of QR codes where the symbols must be fixed against any rotation. We determine the fixing number for several families of graphs, including those arising from combinatorial block designs. We also present several infinite families of graphs with an even stronger condition, where fixing any vertex in a graph fixes every vertex.
- 9 March 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (6) , 1322
Open AccessFixing Numbers of Point-Block Incidence Graphs
A vertex in a graph is referred to as fixed if it is mapped to itself under every automorphism of the vertices. The fixing number of a graph is the minimum number of vertices, when fixed, that fixes all of the vertices in the graph. Fixing numbers were first introduced by Laison and Gibbons, and independently by Erwin and Harary. Fixing numbers have also been referred to as determining numbers by Boutin. The main motivation is to remove all symmetries from a graph. A very simple application is in the creation of QR codes where the symbols must be fixed against any rotation. We determine the fixing number for several families of graphs, including those arising from combinatorial block designs. We also present several infinite families of graphs with an even stronger condition, where fixing any vertex in a graph fixes every vertex.
- Open Access
- 26 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (23) , 4463
Characterization of All Graphs with a Failed Skew Zero Forcing Number of 1
Given a graph G, the zero forcing number of G, , is the minimum cardinality of any set S of vertices of which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is: if a vertex v is in S, and exactly one neighbor u of v is not in S, then u is added to S in the next iteration. Hence the failed zero forcing number of a graph was defined to be the cardinality of the largest set of vertices which fails to force all vertices in the graph. A similar property called skew zero forcing was defined so that if there is exactly one neighbor u of v is not in S, then u is added to S in the next iteration. The difference is that vertices that are not in S can force other vertices. This leads to the failed skew zero forcing number of a graph, which is denoted by . In this paper, we provide a complete characterization of all graphs with . Fetcie, Jacob, and Saavedra showed that the only graphs with a failed zero forcing number of 1 are either: the union of two isolated vertices; ; ; or . In this paper, we provide a surprising result: changing the forcing rule to a skew-forcing rule results in an infinite number of graphs with .- 26 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (23) , 4463
Open AccessCharacterization of All Graphs with a Failed Skew Zero Forcing Number of 1
Given a graph G, the zero forcing number of G, , is the minimum cardinality of any set S of vertices of which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is: if a vertex v is in S, and exactly one neighbor u of v is not in S, then u is added to S in the next iteration. Hence the failed zero forcing number of a graph was defined to be the cardinality of the largest set of vertices which fails to force all vertices in the graph. A similar property called skew zero forcing was defined so that if there is exactly one neighbor u of v is not in S, then u is added to S in the next iteration. The difference is that vertices that are not in S can force other vertices. This leads to the failed skew zero forcing number of a graph, which is denoted by . In this paper, we provide a complete characterization of all graphs with . Fetcie, Jacob, and Saavedra showed that the only graphs with a failed zero forcing number of 1 are either: the union of two isolated vertices; ; ; or . In this paper, we provide a surprising result: changing the forcing rule to a skew-forcing rule results in an infinite number of graphs with . - Open Access
All Graphs with a Failed Zero Forcing Number of Two
Given a graph G, the zero forcing number of G, , is the smallest cardinality of any set S of vertices on which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is: if a vertex v is in S, and exactly one neighbor u of v is not in S, then u is added to S in the next iteration. Zero forcing numbers have attracted great interest over the past 15 years and have been well studied. In this paper, we investigate the largest size of a set S that does not force all of the vertices in a graph to be in S. This quantity is known as the failed zero forcing number of a graph and will be denoted by . We present new results involving this parameter. In particular, we completely characterize all graphs G where , solving a problem posed in 2015 by Fetcie, Jacob, and Saavedra.Open AccessAll Graphs with a Failed Zero Forcing Number of Two
Given a graph G, the zero forcing number of G, , is the smallest cardinality of any set S of vertices on which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is: if a vertex v is in S, and exactly one neighbor u of v is not in S, then u is added to S in the next iteration. Zero forcing numbers have attracted great interest over the past 15 years and have been well studied. In this paper, we investigate the largest size of a set S that does not force all of the vertices in a graph to be in S. This quantity is known as the failed zero forcing number of a graph and will be denoted by . We present new results involving this parameter. In particular, we completely characterize all graphs G where , solving a problem posed in 2015 by Fetcie, Jacob, and Saavedra.