5 citations · 11 across the 6 of their papers we have counts for
6 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…
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 \…
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…
New results on eigenvalues and degree deviation
Felix Goldberg
Let be a graph. In a famous paper Collatz and Sinogowitz had proposed to measure its deviation from regularity by the difference of the (adjacency) spectral radius and the aver…
A lower bound on the entries of the principal eigenvector of a graph
Felix Goldberg
We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.