Extremal pineapple graph conjecture for degree deviation
Statement
Let be the pineapple graph consisting of a clique on vertices together with a stable set on vertices, with one vertex of the clique adjacent to every vertex of the stable set. Let denote the degree deviation of a graph . Pineapple extremal conjecture. Among all graphs on vertices, the graph with the highest value of is
This conjecture concerns the extremal graphs for degree deviation. The supplied text gives no resolution or partial result for the assertion.
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.