ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph. Write Rα=1(G)\mathcal{\mathcal{\mathscr{R}}_{\mathnormal{\alpha=1}}}(G) for the Kirchhoff index based on the hubs-repelling resistance distance, Rα=0(G)\mathcal{\mathcal{\mathscr{R}}}_{\alpha=0}(G) for the standard Kirchhoff index, and Rα=−1(G)\mathcal{\mathcal{\mathscr{R}}_{\mathnormal{\alpha=-1}}}(G) for the Kirchhoff index based on the hubs-attracting resistance distance.

Kirchhoff-index ordering conjecture. For α∈{−1,1}\alpha\in\{-1,1\},

Rα=1(G)≥Rα=0(G)≥Rα=−1(G),\mathcal{\mathcal{\mathscr{R}}_{\mathnormal{\alpha=1}}}(G)\geq\mathcal{\mathcal{\mathscr{R}}}_{\alpha=0}(G)\geq\mathcal{\mathcal{\mathscr{R}}_{\mathnormal{\alpha=-1}}}(G),

with equality if and only if GG is regular.

The conjecture was formulated after computational experiments on more than 12,000 connected graphs with 5≤n≤85\leq n\leq 8, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.