ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with vertex set V(G)V(G), edge set E(G)E(G), n=∣V(G)∣n=|V(G)| vertices, and m=∣E(G)∣m=|E(G)| edges. Its degree deviation measure is

s(G)=∑v∈V(G)∣deg⁡G(v)−2mn∣.s(G)=\sum_{v\in V(G)}\left|\deg_G(v)-\frac{2m}{n}\right|.

For integers nn and kk, let CS(n,k)CS(n,k) denote the complete split graph, and let H(n)H(n) be the set of all connected graphs with nn vertices. de Oliveira et al.'s conjecture.

max⁡G∈H(n)s(G)=s(CS(n,k)),\max_{G\in H(n)}s(G)=s(CS(n,k)),

where

k={n33∣nfracn−133∣n−1fracn−23 and n+133∣n−2.k=\left\{\begin{array}{ll}\frac{n}{3} & 3\mid n\\frac{n-1}{3} & 3\mid n-1\\frac{n-2}{3}\text{ and }\frac{n+1}{3} & 3\mid n-2\end{array}\right..

The conjecture proposes that the complete split graph with the indicated parameter maximizes the degree deviation measure among all connected graphs of order nn.

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.