ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and for p≥1p\geq 1 let mu(p)(G)mu^{(p)}(G) denote its Laplacian pp-spectral radius. Consider the computational problem of finding mu(p)(G)mu^{(p)}(G) from the input graph GG. Computational monotonicity conjecture. If q>p≥1q>p\geq 1, then finding mu(p)(G)mu^{(p)}(G) can be reduced to finding mu(q)(G)mu^{(q)}(G) in polynomial time.

The conjecture is motivated by the fact that the cases p=1p=1 and p=∞p=\infty have different computational behavior: the former is computable in linear time, whereas the latter is NP-complete. It proposes that increasing pp does not make the corresponding exact-value problem computationally easier.

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.