Variable Neighborhood Search for Extremal Graphs. 12. A Note on the Variance of Bounded Degrees in Graphs

Pierre Hansen, Hadrien Mélot, İvan Gutman

2004 · 18 citations · 15 references

Concepts

Abstract

An upper bound is given on the variance of degrees of graphs with n vertices, m edges and maximum degree ∆. Particular cases of chemical interest, i.e., graphs with ∆ = 3 or 4 and at most 2 cycles are examined, and conditions for the bound to be sharp derived.

References

15