The minimum value of the harmonic index for a graph with the minimum degree two
DOI10.1142/S1793557120500540zbMATH Open1441.05053OpenAlexW2896003303MaRDI QIDQ5113047FDOQ5113047
Selvaraj Balachandran, Hanyuan Deng, S. Raja Balachandar
Publication date: 10 June 2020
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557120500540
Linear programming (90C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The harmonic index for graphs
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- On the harmonic index and the chromatic number of a graph
- Harmonic mean labeling of disconnected graphs
- A lower bound for the harmonic index of a graph with minimum degree at least two
- On two conjectures of Randić index and the largest signless Laplacian eigenvalue of graphs
- A unified linear-programming modeling of some topological indices
Cited In (5)
Uses Software
This page was built for publication: The minimum value of the harmonic index for a graph with the minimum degree two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113047)