Darren A. Narayan

activity

20172022

collaborators

Showing math.COShow all

7 papers · 1 filter

math.CO2022

Characterization of Graphs With Failed Skew Zero Forcing Number of 1

Aidan Johnson, Andrew E. Vick, Darren A. Narayan

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 results in all…

math.CO2021

All Graphs with a Failed Zero Forcing Number of Two

Luis Gomez, Karla Rubi, Jorden Terrazas +1

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 results in all…

math.CO2018

Infinite Families of Asymmetric Graphs

Alejandra Brewer, Adam Gregory, Quindel Jones +2

A graph $G$ is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963. They showed that the probability…

math.CO2018

The Asymmetric Index of a Graph

Alejandra Brewer, Adam Gregory, Quindel Jones +1

A graph $G$ is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963 where they measured the degree of asymmetry…

math.CO2017

Uniform Edge Betweenness Centrality

Heather A. Newman, Hector Miranda, Rigoberto Florez +1

The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investiga…

math.CO2017

Extrema Property of the $k$ -Ranking of Directed Paths and Cycles

Breeanne Baker Swart, Rigoberto Flórez, Darren A. Narayan +1

A $k$ -ranking of a directed graph $G$ is a labeling of the vertex set of $G$ with $k$ positive integers such that every directed path connecting two vertices with the same label in…