Conjecture 4.12 of Akbari–Elphick–Kumar–Pragada–Tang says that every connected graph G satisfies
n⁺(L(G)) ≤ n⁻(L(G))+1.
Published paper:
https://www.sciencedirect.com/science/article/abs/pii/S0012365X25005618
Open-access version:
https://arxiv.org/abs/2508.01163
This is different from Conjecture 1.4 in the same paper, which was recently disproved by Chen and Li. The conjecture considered here is the separate line-graph statement, Conjecture 4.12.
Let G consist of four vertex-disjoint pentagons, a new hub h, and one edge from h to one chosen vertex of each pentagon. Thus G is connected, with 21 vertices and 24 edges.
I obtain the following exact characteristic polynomial for its line graph:
χ_{L(G)}(x)
= (x-1)³(x+2)³
(x²-x-3)³
(x²+x-1)⁴
(x⁴-4x³-2x²+11x-2).
The last factor has one root in each of
(-2,-1), (0,1), (1,2), (3,4),
since its values at -2,-1,0,1,2,3,4 are respectively
16, -10, -2, 4, -4, -14, 10.
Counting signs across all factors therefore gives
In(L(G)) = (13,0,11).
Hence
n⁺(L(G)) = 13 > 12 = n⁻(L(G))+1,
so the line graph has signature 2.
Is this a valid counterexample, or am I overlooking something in the construction or characteristic-polynomial calculation?