5 citations · 14 across the 13 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…
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.
A spectral bound for graph irregularity
Felix Goldberg
The imbalance of an edge in a graph is defined as , where is the vertex degree. The irregularity of is then defined as the sum o…
On monotonicity-preserving perturbations of -matrices
Felix Goldberg
We obtain an explicit analytical sufficient condition on that ensures the monotonicity of the matrix , where is an -matrix.
On the sign patterns of the smallest signless Laplacian eigenvector
Felix Goldberg, Steve Kirkland
Let be a connected bipartite graph, whose signless Laplacian matrix is . Suppose that the bipartition of is and that is the eigenvector of the smallest ei…
Zero forcing for sign patterns
Felix Goldberg, Abraham Berman
We introduce a new variant of zero forcing - signed zero forcing. The classical zero forcing number provides an upper bound on the maximum nullity of a matrix with a given graph (i…
On the maximum angle between copositive matrices
Felix Goldberg, Naomi Shaked-Monderer
Hiriart-Urruty and Seeger have posed the problem of finding the maximal possible angle between two copositive matrices of order . They have proved th…
The Colin de Verdière Graph Parameter for Threshold Graphs
Hans Christianson, Felix Goldberg
We consider Schrödinger operators on threshold graphs and prove a formula for the Colin de Verdière parameter in terms of the building sequence. We construct an optimal Colin de Ve…