2004 · 18 citations · 15 references
Natural SciencesChemistryMathematicsComputational GeometryOptimizationPhysical ChemistryExtremal CombinatoricsGraph AlgorithmsGraph TheoryComputational Complexity Of Graph AlgorithmsNeighborhood SearchRandom Graph ModelsRandom Graph TheoryUpper Bound ComputationVariable Neighborhood Search
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
Graph theory and molecular orbitals. XII. Acyclic polyenes
İvan Gutman, B. Ru ić, Nenad Trinajstić et al. · The Journal of Chemical Physics · 1975 · 816 citations
Natural Sciences, Chemistry, Physics +11
Graph Theory and Molecular Orbitals. II
Dragoš Cvetković, İvan Gutman, Nenad Trinajstić · Croatica Chemica Acta · 1972 · 325 citations
Natural Sciences, Chemistry, Physics +14
Variable neighborhood search for extremal graphs
Gilles Caporossi, İvan Gutman, Pierre Hansen · Computers & Chemistry · 1999 · 246 citations