de Oliveira et al.'s degree deviation conjecture for connected graphs
Statement
Let be a graph with vertex set , edge set , vertices, and edges. Its degree deviation measure is
For integers and , let denote the complete split graph, and let be the set of all connected graphs with vertices. de Oliveira et al.'s conjecture.
where
The conjecture proposes that the complete split graph with the indicated parameter maximizes the degree deviation measure among all connected graphs of order .
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.