2 citations · 3 across the 7 of their papers we have counts for
10 papers
Characterization of Graphs With Failed Skew Zero Forcing Number of 1
Aidan Johnson, Andrew E. Vick, Darren A. Narayan
Given a graph , the zero forcing number of , , is the smallest cardinality of any set of vertices on which repeated applications of the forcing rule results in all…
All Graphs with a Failed Zero Forcing Number of Two
Luis Gomez, Karla Rubi, Jorden Terrazas +1
Given a graph , the zero-forcing number of , , is the smallest cardinality of any set of vertices on which repeated applications of the forcing rule results in all…
Infinite Families of Asymmetric Graphs
Alejandra Brewer, Adam Gregory, Quindel Jones +2
A graph 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…
The Asymmetric Index of a Graph
Alejandra Brewer, Adam Gregory, Quindel Jones +1
A graph 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…
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…
Edge-Transitive Graphs
Heather A. Newman, Hector Miranda, Darren A. Narayan
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. I…