z-logo
open-access-imgOpen Access
A lower bound for the harmonic index of a graph with minimum degree at least three
Author(s) -
Minghong Cheng,
Ligong Wang
Publication year - 2016
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1608249c
Subject(s) - mathematics , combinatorics , graph , vertex (graph theory) , degree (music) , upper and lower bounds , bound graph , quartic graph , discrete mathematics , graph power , mathematical analysis , line graph , physics , acoustics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom