G-2004-74
Variable Neighborhood Search for Extremal Graphs. 12. A Note on the Variance of Bounded Degrees in Graphs
, et référence BibTeX
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.
Paru en octobre 2004 , 15 pages
Axes de recherche
Applications de recherche
Publication
jan. 2005
Variable neighborhood search for extremal graphs. 12. A note on the variance of bounded degrees in graphs
, et
MATCH, Communications in Mathematical and in Computer Chemistry, 54, 221–232, 2005
référence BibTeX