Distinct leverage centralities in Cartesian powers of path powers
Statement
Let denote the th power of the path graph on vertices, and let
be the Cartesian product of copies of , with . The leverage-centrality count conjecture. The number of distinct leverage centralities in is
The authors verified the analogous count computationally for small values of and , and the claim seeks the general formula for these Cartesian products.
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.