8 citations · 33 across the 25 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.CO2026
Sustainable trees
Ferenc Bencs, Maarten van Dijk, Krystal Guo
Let be a connected graph and let denote the spectral radius of its adjacency matrix. An edge of is sustainable if it can be deleted and replaced by a non-edge…
math.PR2026
On the self-intersection time of non-backtracking random walks
Ferenc Bencs, Leslie Ann Goldberg, Matthew Jenssen +4
We study the self-intersection time of the non-backtracking random walk on connected undirected graphs. For every fixed we show that the expected self-intersection time i…
math.CO2026
On the complex zeros and the computational complexity of approximating the reliability polynomial
Ferenc Bencs, Chiara Piombi, Guus Regts
In this paper we relate the location of the complex zeros of the reliability polynomial to parameters at which a certain family of rational functions derived from the reliability p…