Abstract
Given H, a hexagonal chain, we determine an expression of its second-order general connectivity index, denoted by χ2α(H), in terms of inlet features of H. Moreover, by applying the method in integer programming theory, we completely determine the extremal chains with the minimal or maximal χ2α(H) over the set of hexagonal chains.
Highlights
A hexagonal system is a finite connected plane graph without cut vertices, in which every interior face is bounded by a regular hexagon of side of length one
We can associate to each path u1 −u2 −⋅ ⋅ ⋅−uk+1 of length k in H, with the vertex degree sequence
If one goes along the perimeter of H, a fissure, bay, cove, and fjord are, respectively, paths of degree sequences (2, 3, 2), (2, 3, 3, 2), (2, 3, 3, 3, 2), and (2, 3, 3, 3, 3, 2) (see Figure 1(i))
Summary
A hexagonal system is a finite connected plane graph without cut vertices, in which every interior face is bounded by a regular hexagon of side of length one. If one goes along the perimeter of H, a fissure, bay, cove, and fjord are, respectively, paths of degree sequences (2, 3, 2), (2, 3, 3, 2), (2, 3, 3, 3, 2), and (2, 3, 3, 3, 3, 2) (see Figure 1(i)). Mathematical Problems in Engineering cove bay fissure ord a hexagonal chain
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
