Albertson defined the irregularity of a graph GG as irr(G)=∑uv∈E(G)∣dG(u)−dG(v)∣irr(G)=uv∈E(G)∑∣dG(u)−dG(v)∣. For a graph GG with nn vertices, mm edges, maximum degree ΔΔ, and d=⌊ΔmΔn−m⌋d=⌊Δn−mΔm⌋, we show irr(G)≤d(d+1)n+1Δ(Δ2−(2d+1)Δ−d2−d)m.irr(G)≤d(d+1)n+Δ1(Δ2−(2d+1)Δ−d2−d)m.
生成讲解博客的中文版本
生成AI智能校验的中文版本