The extremal alpha-index and algebraic-connectivity conjecture for k-path graphs
Statement
Let denote a -path graph of order , let be the complete graph on vertices, let be the path on vertices, and let denote the graph join. For a graph , write for , where and are its adjacency and degree matrices; the -index is the largest eigenvalue of . The -weak-generalized-fan is the unique -path graph, up to isomorphism, having a vertex such that deleting yields .
Extremal alpha-index and algebraic-connectivity conjecture. Given fixed and , the unique -path graph that maximizes the -index for is . Moreover, under the same conditions, the unique -path graph that maximizes is the -weak-generalized-fan.
The conjecture proposes simultaneous extremal descriptions for the -index and for the second eigenvalue of . It is based on the structural definitions and experiments presented in the source; no proof or resolution is given there.
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.