The equivalence of NT-balanced and ultra NT-balanced graphs
Statement
Let be a graph. For vertices and an integer , let be the number of vertices whose distance difference relative to and equals . Call NT-balanced when for every pair of vertices and every relevant integer . Call it ultra NT-balanced when, for every pair , there is an involution of the vertex set pairing vertices counted by with vertices counted by .
NT-balance equivalence conjecture. Every NT-balanced graph is also ultra NT-balanced.
The paper proves that ultra NT-balanced graphs are closed under Cartesian products and uses this to construct arbitrarily large examples. Whether every NT-balanced graph admits the required involutions remains open.
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.