The extremal average communicability angle conjecture for connected graphs
Statement
Let be a connected graph with nodes. Write for the path graph on nodes, for the complete graph on 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 nodes, the average communicability angle is largest for and smallest for . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.