2 citations · 13 across the 20 of their papers we have counts for
24 papers
Resolution of a problem of Mohar on non-positive inertia
Clive Elphick, Hitesh Kumar, Shivaramakrishna Pragada +1
For a graph of order , its positive, negative and non-positive inertia is the number of positive, negative and non-positive eigenvalues of its adjacency matrix , respe…
Proof of a conjectured spectral upper bound on the chromatic number of a graph
Quanyu Tang, Clive Elphick
Let be a simple graph on vertices and edges with chromatic number , and let denote the least adjacency eigenvalue. Solving a conjecture of Fan, Yu and Wang~[El…
A new conjecture on the inertia of graphs
Saieed Akbari, Clive Elphick, Hitesh Kumar +2
Let be a graph with adjacency matrix . We conjecture that \[2n^+(G) \le n^-(G)(n^-(G) + 1),\] where and denote the number of positive and negative eigen…
Inertia, Independence and Expanders
Quanyu Tang, Shengtong Zhang, Clive Elphick
Let be a graph on vertices, independence number , Lovász theta function , and Shannon capacity . We define to be the minimum number…
A Spectral Lower Bound on Chromatic Numbers using -Energy
Clive Elphick, Quanyu Tang, Shengtong Zhang
Let be the adjacency matrix of a simple graph , and let , , , and denote its chromatic number, fractional chromatic numb…
Symmetry and asymmetry between positive and negative square energies of graphs
Clive Elphick, William Linz
The positive and negative square energies of a graph, and , are the sums of squares of the positive and negative eigenvalues of the adjacency matrix, respectively.…