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

, , and

BibTeX reference

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.

, 15 pages

Research Axes

Research applications


Variable neighborhood search for extremal graphs. 12. A note on the variance of bounded degrees in graphs
, , and
MATCH, Communications in Mathematical and in Computer Chemistry, 54, 221–232, 2005 BibTeX reference