Harmonic index of graphs with more than one cut-vertex.

zbMATH Open1463.05064MaRDI QIDQ3134327FDOQ3134327

Authors: J. Amalorpava Jerline, L. Benedict Michaelraj, K. Dhanalakshmi, P. Syamala 

Publication date: 9 February 2018

Recommendations

• The harmonic index for graphs
• On harmonic indices of trees, unicyclic graphs and bicyclic graphs.
• On the harmonic index of two-tree
• Some properties on the harmonic index of molecular trees
• The harmonic index of a graph

zbMATH Keywords

blockdegreeharmonic indexcut-vertexcut-edge

Mathematics Subject Classification ID

Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Vertex degrees (05C07)

Cited In (4)

• Computing harmonic indices of series benzenoid \(H_k\) and hydrocarbons \(PAH_k\) by use of cut method
• On the \(n\)-vertex trees with sixth to fifteenth maximum harmonic indices
• Some indices of graphs with more than one cut-edge.
• Title not available (Why is that?)

This page was built for publication: Harmonic index of graphs with more than one cut-vertex.

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