C. Elphick

activity

20122026

most citedUpper bounds for the achromatic and coloring numbers of a graph

2 citations · 13 across the 20 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

math.CO2014

A (forgotten) upper bound for the spectral radius of a graph

Clive Elphick, Chia-an Liu

The best degree-based upper bound for the spectral radius is due to Liu and Weng. This paper begins by demonstrating that a (forgotten) upper bound for the spectral radius dating f…

math.CO2014★ 1 cited

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 $μ_{1}^{2} \leq 2 m - n + 1$ . It is conjectured that for connected graphs $n - 1 \leq s^{+} \leq 2 m - n + 1$ …