Minimal hexagonal chains with respect to the Kirchhoff index

Let G be a connected graph. The resistance distance between any two vertices of G is equal to the effective resistance between them in the corresponding electrical network constructed from G by replacing each edge with a unit resistor. The Kirchhoff index of G is defined as the sum of resistance distances between all pairs of vertices. Hexagonal chains are graph representations of unbranched catacondensed benzenoid hydrocarbons. It was shown in Yang and Klein (2014) [30] that among all hexagonal chains with n hexagons, the linear chain $L_n$ is the unique chain with maximum Kirchhoff index. However, for hexagonal chains with minimum Kirchhoff index, it was only claimed that the minimum Kirchhoff index is attained only when the hexagonal chain is an “all–kink” chain. In this paper, by standard techniques of electrical networks and comparison results on Kirchhoff indices of $S,T$-isomers, “all-kink” chains with maximum and minimum Kirchhoff indices are characterized. As a consequence, hexagonal chains with minimum Kirchhoff indices are singled out.     

A Note on General Third Geometric-arithmetic Index of Sp ecial Chemical Molecular Structures

In theoretical chemistry, the geometric-arithmetic indices were introduced to measure the stability of alkanes and the strain energy of cycloalkanes. In this note, we report the general third geometric-arithmetic index of unilateral polyomino chain and unilateral hexagonal chain. Also, the third geometric-arithmetic index of these chemical structures are presented.     

Extremal double hexagonal chains with respect to k-matchings and k-independent sets

“Double hexagonal chains” can be considered as benzenoids constructed by successive fusions of successive naphthalenes along a zig-zag sequence of triples of edges as appear on opposite sides of each naphthalene unit. In this paper, we discuss the numbers of k-matchings and k-independent sets of double hexagonal chains, as well as Hosoya indices and Merrifield-Simmons indices, and obtain some extremal results: among all the double hexagonal chains with the same number of naphthalene units, (a) the double linear hexagonal chain has minimal k-matching number and maximal k-independent set number and (b) the double zig-zag hexagonal chain has maximal k-matching number and minimal k-independent set number, which are extensions to hexagonal chains [L. Zhang and F. Zhang, Extremal hexagonal chains concerning k-matchings and k-independent sets, J. Math. Chem. 27 (2000) 319-329].     

Extremal Hosoya index and Merrifield-Simmons index of hexagonal spiders

For any graph G, let m(G) and i(G) be the numbers of matchings (i.e., the Hosoya index) and the number of independent sets (i.e., the Merrifield-Simmons index) of G, respectively. In this paper, we show that the linear hexagonal spider and zig-zag hexagonal spider attain the extremal values of Hosoya index and Merrifield-Simmons index, respectively.     

On well-rounded sublattices of the hexagonal lattice

We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest signal-to-noise ratio of well-rounded sublattices of the hexagonal lattice of a fixed index. This investigation parallels earlier work by Bernstein, Sloane, and Wright where similar questions were addressed on the space of all sublattices of the hexagonal lattice. Our restriction is motivated by the importance of well-rounded lattices for discrete optimization problems. Finally, we also discuss the existence of a natural combinatorial structure on the set of similarity classes of well-rounded sublattices of the hexagonal lattice, induced by the action of a certain matrix monoid.     

Gutman极值六角链猜想的证明

六角系统是理论化学中苯碳氢化合物的自然图表示．六角链是一个六角系统满足任意一个顶点至多属于两个六角形，并且每个六角形至多与两个六角形相邻．Gutman提出了两个猜想：1）含有相同六角形个数、具有点独立集总数（Hosoya指数）最小的六角链是唯一的，且为锯齿链；2）含有相同六角形个数、具有边独立集总数（Merrifield－Simmons指数）最大的六角链是唯一的且为锯齿链．本文证实了这两个猜想     

Degree-based topological indices of hexagonal nanotubes

There are several papers that determine one or a few chosen degree-based topological indices for hexagonal nanotubes. We present formulas, which can be used to compute any degree-based topological index for those nanotubes. Then we give exact values of the best-known degree-based indices for hexagonal nanotubes.     

Resistance distances and the Kirchhoff index in Cayley graphs

In this paper, closed-form formulae for the Kirchhoff index and resistance distances of the Cayley graphs over finite abelian groups are derived in terms of Laplacian eigenvalues and eigenvectors, respectively. In particular, formulae for the Kirchhoff index of the hexagonal torus network, the multidimensional torus and the t-dimensional cube are given, respectively. Formulae for the Kirchhoff index and resistance distances of the complete multipartite graph are obtained.     

Rank-1 numerical index of some families of norms on the plane

We compute the rank-1 numerical index of a family of hexagonal norms and two families of octagonal norms on the real plane.     

Numerical index of some polyhedral norms on the plane

We give explicit formulae for the numerical index of some (real) polyhedral spaces of dimension two. Concretely, we calculate the numerical index of a family of hexagonal norms, two families of octagonal norms and the family of norms whose unit balls are regular polygons with an even number of vertices.     

Analysis of arbitrarily shaped planar cracks in two-dimensional hexagonal quasicrystals with thermal effects. Part I: Theoretical solutions

An extended displacement discontinuity (EDD) boundary integral equation method is proposed for analysis of arbitrarily shaped planar cracks in two-dimensional (2D) hexagonal quasicrystals (QCs) with thermal effects. The EDDs include the phonon and phason displacement discontinuities and the temperature discontinuity on the crack surface. Green's functions for unit point EDDs in an infinite three-dimensional medium of 2D hexagonal QC are derived using the Hankel transform method. Based on the Green's functions and the superposition theorem, the EDD boundary integral equations for an arbitrarily shaped planar crack in an infinite 2D hexagonal QC body are established. Using the EDD boundary integral equation method, the asymptotic behavior along the crack front is studied and the classical singular index of 1/2 is obtained at the crack edge. The extended stress intensity factors are expressed in terms of the EDDs across crack surfaces. Finally, the energy release rate is obtained using the definitions of the stress intensity factors.     

Extremal polyomino chains with respect to Zagreb indices

For a molecular graph, the first Zagreb index M₁ is equal to the sum of squares of the vertex degrees and second Zagreb index M₂ is equal to the sum of products of degree of pairs of adjacent vertices. In this paper, Zagreb indices of polyomino chains are computed. Also the extremal polyomino chains with respect to Zagreb indices are determined.     

Die Sechseck-n-Waben in der Ebene,welche von n Kreisbüscheln erzeugt werden

In this paper, the problem of determining the pencils of circles which form a hexagonal n-web in E₂, is completely solved. It is well-known that n pencils of circles orthogonal to a fixed circle form a hexagonal n-web. Therefore, the main problem is the determination of all circle pencils which form a hexagonal n-web and which do not cut a fixed circle orthogonally. In this connection the following results have been obtained: The number of hexagonal 4-webs is six, whereas the number of hexagonal 5-webs is two.Finally, after having proved that the number of hexagonal 6-webs is one, it is shown that, for n7, there exist no circle pencils forming a hexagonal n-web without being orthogonal to a fixed circle.     

On the Kirchhoff index of some toroidal lattices

The resistance distance is a novel distance function on a graph proposed by Klein and Randi? [D.J. Klein and M. Randi?, Resistance distance, J. Math. Chem. 12 (1993), pp. 81–85]. The Kirchhoff index of a graph G is defined as the sum of resistance distances between all pairs of vertices of G. In this article, based on the result by Gutman and Mohar [I. Gutman and B. Mohar, The quasi-Wiener and the Kirchhoff indices coincide, J. Chem. Inf. Comput. Sci. 36 (1996), pp. 982–985], we compute the Kirchhoff index of the square, 8.8.4, hexagonal and triangular lattices, respectively.     

On sublattices of the hexagonal lattice

How many sublattices of index N are there in the planar hexagonal lattice? Which of them are the best from the point of view of packing density, signal-to-noise ratio, or energy? We answer the first question completely and give partial answers to the other questions.     

Modified offensive earned-run average with steal effect for baseball

This short article introduces and studies a modified offensive earned-run average (MOERA) index which is based on a stationary Markov chain and evaluates the contribution of a player in baseball. An original offensive earned-run average (OERA) index does not consider the effect of stealing. The MOERA index proposed here includes the effect. Some examples are presented for Japanese professional baseball players.     

Set-Up Coordination between Two Stages of a Supply Chain

In the material flow of a plant, parts are processed in batches, each having two distinct attributes, say shape and color. In one department, a set-up occurs every time the shape of the new batch is different from the previous one. In a downstream department, there is a set-up when the color of the new batch is different from the previous one. Since a unique sequence of batches must be established, the problem consists in finding such a common sequence optimizing an overall utility index. Here we consider two indices, namely the total number of set-ups and the maximum number of set-ups between the two departments. Both problems are shown to be NP-hard. An efficient heuristic approach is presented for the first index which allows to solve a set of real-life instances and performs satisfactorily on a large sample of experimental data.     

Hosoya polynomials under gated amalgamations

An induced subgraph H of a graph G is gated if for every vertex x outside H there exists a vertex x^′ inside H such that each vertex y of H is connected with x by a shortest path passing through x^′. The gated amalgam of graphs G₁ and G₂ is obtained from G₁ and G₂ by identifying their isomorphic gated subgraphs H₁ and H₂. Two theorems on Hosoya polynomials of gated amalgams are provided. As their applications, explicit expressions for Hosoya polynomials of hexagonal chains are obtained.     

Major index for 01-fillings of moon polyominoes

We propose a major index statistic on 01-fillings of moon polyominoes which, when specialized to certain shapes, reduces to the major index for permutations and set partitions. We consider the set F(M,s;A) of all 01-fillings of a moon polyomino M with given column sum s whose empty rows are A, and prove that this major index has the same distribution as the number of north-east chains, which are the natural extension of inversions (resp. crossings) for permutations (resp. set partitions). Hence our result generalizes the classical equidistribution results for the permutation statistics inv and maj. Two proofs are presented. The first is an algebraic one using generating functions, and the second is a bijection on 01-fillings of moon polyominoes in the spirit of Foata's second fundamental transformation on words and permutations.     

Enumeration of Wiener indices in random polygonal chains

The Wiener index of a connected graph (molecule graph) G is the sum of the distances between all pairs of vertices of G, which was reported by Wiener in 1947 and is the oldest topological index related to molecular branching. In this paper, simple formulae of the expected value of the Wiener index in a random polygonal chain and the asymptotic behavior of this expectation are established by solving a difference equation. Based on the results above, we obtain the average value of the Wiener index of all polygonal chains with n polygons. As applications, we use the unified formulae to obtain the expected values of the Wiener indices of some special random polygonal chains which were deeply discussed in the context of organic chemistry or statistical physics.