Faculty and Student Publications
Document Type
Article
Publication Date
1-1-2019
Abstract
© 2019, University of Nis. All rights reserved. Zagreb indices and their modified versions of a molecular graph originate from many practical problems such as two dimensional quantitative structure-activity (2D QSAR) and molecular chirality. Nowadays, they have become important invariants which can be used to characterize the properties of graphs from different aspects. Let Vkn (or Ekn respectively) be a set of graphs of n vertices with vertex connectivity (or edge connectivity respectively) at most k. In this paper, we explore some properties of the modified first and second multiplicative Zagreb indices of graphs in Vkn and Ekn. By using analytic and combinatorial tools, we obtain some sharp lower and upper bounds for these indices of graphs in Vkn and Ekn. In addition, the corresponding extremal graphs which attain the lower or upper bounds are characterized. Our results enrich outcomes on studying Zagreb indices and the methods developed in this paper may provide some new tools for investigating the values on modified multiplicative Zagreb indices of other classes of graphs.
Relational Format
journal article
Recommended Citation
Wang, H., Wang, S., & Wei, B. (2019). Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k. Filomat, 33(14), 4673–4685. https://doi.org/10.2298/FIL1914673W
DOI
10.2298/FIL1914673W
Accessibility Status
Searchable text