ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph with nn nodes. Write PnP_n for the path graph on nn nodes, KnK_n for the complete graph on nn nodes, and let the average communicability angle be the average of the communicability angles over pairs of nodes. Extremal communicability-angle conjecture. Among all connected graphs with nn nodes, the average communicability angle is largest for PnP_n and smallest for KnK_n. The claim is motivated by verification for all connected graphs with 5, 6, 7, and 8 nodes; its general validity 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 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.