Open AccessSOME BOUNDS ON SUM CONNECTIVITY AND PRODUCT CONNECTIVITY ZAGREB-K-BANHATTI INDICES OF GRAPHS.
Author(s) -
V. R. Kulli
Publication year - 2020
Publication title -
international journal of engineering, sciences and research technology
Language(s) - English
Resource type - Journals
ISSN - 2277-9655
DOI - 10.29121/ijesrt.v9.i9.2020.15
Subject(s) - topological index , graph , combinatorics , connectivity , index (typography) , mathematics , graph theory , product (mathematics) , computer science , geometry , world wide web
The connectivity indices are applied to measure the chemical characteristics of compound in Chemical Graph Theory. In this paper, we introduce the sum connectivity Zagreb-K-Banhatti index and product connectivity Zagreb-K-Banhatti index of a graph. We provide lower and upper bounds for the sum connectivity Zagreb-K-Banhatti index and product connectivity Zagreb-K-Banhatti index of a graph in terms of Zagreb and K-Banhatti indices.