ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnkP_n^k denote a kk-path graph of order nn, let Kk−1K_{k-1} be the complete graph on k−1k-1 vertices, let Pn−k+1P_{n-k+1} be the path on n−k+1n-k+1 vertices, and let ∨\vee denote the graph join. For a graph GG, write Aα(G)=αD(G)+(1−α)A(G)A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G) for α∈[0,1]\alpha\in[0,1], where A(G)A(G) and D(G)D(G) are its adjacency and degree matrices; the α\alpha-index is the largest eigenvalue of Aα(G)A_\alpha(G). The kk-weak-generalized-fan is the unique kk-path graph, up to isomorphism, having a vertex vv such that deleting vv yields Kk−1∨Pn−kK_{k-1}\vee P_{n-k}.

Extremal alpha-index and algebraic-connectivity conjecture. Given fixed n≥k+1n\geq k+1 and k≥2k\geq 2, the unique kk-path graph that maximizes the α\alpha-index for α∈[0,1]\alpha\in[0,1] is Kk−1∨Pn−k+1K_{k-1}\vee P_{n-k+1}. Moreover, under the same conditions, the unique kk-path graph that maximizes λ2(Aα)\lambda_2(A_\alpha) is the kk-weak-generalized-fan.

The conjecture proposes simultaneous extremal descriptions for the α\alpha-index and for the second eigenvalue of AαA_\alpha. 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 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.