Sharp Bounds for the Second-Order General Connectivity Index of Hexagonal Chains

Deqiang Chen

Mathematical Problems in Engineering, 2018, vol. 2018, 1-7

Abstract:

Given , a hexagonal chain, we determine an expression of its second-order general connectivity index, denoted by   , in terms of inlet features of . Moreover, by applying the method in integer programming theory, we completely determine the extremal chains with the minimal or maximal over the set of hexagonal chains.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2018/7506541.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2018/7506541.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:7506541

DOI: 10.1155/2018/7506541

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().