ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a unicyclic graph of order nn whose cycle has size kk. The path energy PE(G)PE(G) is defined for such graphs. Path energy conjecture for unicyclic graphs. PE(G)PE(G) depends only on the parameters nn and kk. For fixed nn, PE(G)PE(G) is a monotonically increasing function of kk. The surrounding text states that the paper gives results resolving Conjectures 2, 3, and 4 from the cited work; this claim is one of those results and is therefore presented as solved.

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.