Estrada–Mugnolo's Kirchhoff-index ordering conjecture for hubs-biased resistance distances
Statement
Let be a connected graph. Write for the Kirchhoff index based on the hubs-repelling resistance distance, for the standard Kirchhoff index, and for the Kirchhoff index based on the hubs-attracting resistance distance.
Kirchhoff-index ordering conjecture. For ,
with equality if and only if is regular.
The conjecture was formulated after computational experiments on more than 12,000 connected graphs with , and predicts that hubs-repelling navigation gives the largest Kirchhoff index while hubs-attracting navigation gives the smallest. Its general validity is left open in the source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.