Premium
Steiner degree distance indices: Chemical applicability and bounds
Author(s) -
Redžepović Izudin,
Mao Yaping,
Wang Zhao,
Furtula Boris
Publication year - 2020
Publication title -
international journal of quantum chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.484
H-Index - 105
eISSN - 1097-461X
pISSN - 0020-7608
DOI - 10.1002/qua.26209
Subject(s) - degree (music) , combinatorics , extension (predicate logic) , mathematics , graph , computer science , physics , acoustics , programming language
The k ‐center Steiner degree distance ( SDD k ( G ) ) has recently been introduced as a natural extension of the degree distance DD ( G ). In this paper, the prediction potential of SDD k ( G ) is discussed. Then, the relation between this and some other well‐known distance‐based indices of trees is derived to explain its prediction potential. Finally, the lower and upper bounds of SDD k ( G ) in terms of some other graph invariants are presented.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom