5 citations · 12 across the 12 of their papers we have counts for
14 papers
Chip-firing may be much faster than you think
Felix Goldberg
A new bound (Theorem \ref{thm:main}) for the duration of the chip-firing game with chips on a -vertex graph is obtained, by a careful analysis of the pseudo-inverse of the d…
Conjectured bounds for the sum of squares of positive eigenvalues of a graph
Clive Elphick, Felix Goldberg, Miriam Farber +1
A well known upper bound for the spectral radius of a graph, due to Hong, is that . It is conjectured that for connected graphs …
Spectral radius minus average degree: a better bound
Felix Goldberg
Collatz and Sinogowitz had proposed to measure the departure of a graph from regularity by the difference of the (adjacency) spectral radius and the average degree: $ε(G)=ρ(G)-…
Graph energy estimates via the Chebyshev functional
Felix Goldberg
Let be a graph with vertices and edges. The energy of the graph is defined as the sum of the moduli of the adjacency eigenvalues $λ_{1} \geq λ_{2} \geq \ldots \…
On split graphs with four distinct eigenvalues
Felix Goldberg, Steve Kirkland, Anu Varghese +1
It is a well-known fact that a graph of diameter has at least eigenvalues. Let us call a graph \emph{-extremal} if it has diameter and exactly eigenvalues. S…
Domination in designs
Felix Goldberg, Deepak Rajendraprasad, Rogers Mathew
We commence the study of domination in the incidence graphs of combinatorial designs. Let be a combinatorial design and denote by the domination number of the incidence…