Inverse degree, Randic index and harmonic index of graphs | Zendy

Kinkar Ch. Das | Zendy; Selvaraj Balachandran | Zendy; Iván Gutman | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Inverse degree, Randic index and harmonic index of graphs

Author(s) -

Kinkar Ch. Das,

Selvaraj Balachandran,

Iván Gutman

Publication year - 2017

Publication title -

applicable analysis and discrete mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.69

H-Index - 26

eISSN - 2406-100X

pISSN - 1452-8630

DOI - 10.2298/aadm1702304d

Subject(s) - mathematics , inverse , combinatorics , vertex (graph theory) , degree (music) , graph , topological index , discrete mathematics , geometry , physics , acoustics

Motivated by a Graffiti conjecture [8], Zhang et al. [23] established upper and lower bounds on ID(T ) + β(T ) for any tree T , where β is the number of independent edges. Hu et al. [12] determined the extremal graphs with respect to ID among all connected graphs of order n and with m edges. Dankelmann et al. [5] determined a relation between ID and edge-connectivity. In the same paper a bound is established on the diameter in terms of ID. Mukwembi [16]

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