92 citations · 106 across the 20 of their papers we have counts for
4 papers · 1 filter
On the Last New Vertex Visited by a Random Walk in a Directed Graph
Calum Buchanan, Paul Horn, Puck Rombach
Consider a simple graph in which a random walk begins at a given vertex. It moves at each step with equal probability to any neighbor of its current vertex, and ends when it has vi…
Toughness of recursively partitionable graphs
Calum Buchanan, Brandon Du Preez, K. E. Perry +1
A simple graph on vertices is said to be recursively partitionable (RP) if , or if is connected and satisfies the following recursive property: for…
The effect of the Katz parameter on node ranking, with a medical application
Hunter Rehm, Mona Matar, Puck Rombach +1
Katz centrality is a popular network centrality measure. It takes a (weighted) count of all walks starting at each node, with an additional damping factor of that tunes the inf…
Odd Covers of Graphs
Calum Buchanan, Alexander Clifton, Eric Culver +4
Given a finite simple graph , an odd cover of is a collection of complete bipartite graphs, or bicliques, in which each edge of appears in an odd number of bicliques and…