Resistance increment conjecture for straight linear k-trees
Statement
Let be the straight linear -tree with and vertices, and let be the straight linear -tree with vertices. Let and denote resistance distance in these graphs. Resistance increment conjecture.
For , the paper proves the corresponding increment is and hence the end-to-end resistance is unbounded. The formula for general is supported by empirical evidence and 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.