The linear programming approach to the harmonic index of a graph with minimum degree at least three.

MaRDI QIDQ4558646zbMATH OpenFDO

Authors Renying Chang, Yan Zhu

Publication date 29 November 2018

zbMATH Keywords

linear programmingminimum degreeharmonic index

Mathematics Subject Classification ID

Linear programming (90C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Recommendations

• A lower bound for the harmonic index of a graph with minimum degree at least three
• The minimum value of the harmonic index for a graph with the minimum degree two
• A lower bound for the harmonic index of a graph with minimum degree at least two
• The harmonic index for graphs
• Solution to the minimum harmonic index of graphs with given minimum degree

Cited in

(4)

• A lower bound for the harmonic index of a graph with minimum degree at least two
• Solution to the minimum harmonic index of graphs with given minimum degree
• A lower bound for the harmonic index of a graph with minimum degree at least three
• The minimum value of the harmonic index for a graph with the minimum degree two

This page was built for publication: The linear programming approach to the harmonic index of a graph with minimum degree at least three.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558646)