PI indices of pericondensed benzenoid graphs

The Padmakar–Ivan (PI) index is a graph invariant defined as the summation of the sums of n _eu (e|G) and n _ev (e|G) over all the edges e = uv of a connected graph G, i.e., , where n _eu (e|G) is the number of edges of G lying closer to u than to v and n _ev (e|G) is the number of edges of G lying closer to v than to u. An efficient formula for calculating the PI index of a class of pericondensed benzenoid graphs consisting of three rows of hexagonal of various lengths.     

Analytical expressions for topological properties of polycyclic benzenoid networks

Quantitative structure‐activity and structure‐property relationships of complex polycyclic benzenoid networks require expressions for the topological properties of these networks. Structure‐based topological indices of these networks enable prediction of chemical properties and the bioactivities of these compounds through quantitative structure‐activity and structure‐property relationships methods. We consider a number of infinite convex benzenoid networks that include polyacene, parallelogram, trapezium, triangular, bitrapezium, and circumcorone series benzenoid networks. For all such networks, we compute analytical expressions for both vertex‐degree and edge‐based topological indices such as edge‐Wiener, vertex‐edge Wiener, vertex‐Szeged, edge‐Szeged, edge‐vertex Szeged, total‐Szeged, Padmakar‐Ivan, Schultz, Gutman, Randić, generalized Randić, reciprocal Randić, reduced reciprocal Randić, first Zagreb, second Zagreb, reduced second Zagreb, hyper Zagreb, augmented Zagreb, atom‐bond connectivity, harmonic, sum‐connectivity, and geometric‐arithmetic indices. In addition we have obtained expressions for these topological indices for 3 types of parallelogram‐like polycyclic benzenoid networks.     

Analytical expressions for the count of LM-conjugated circuits of benzenoid hydrocarbons

A recursive method for enumeration of linearly independent and minimal conjugated circuits of benzenoid hydrocarbons had previously been given which is valid for several classes of benzenoid hydrocarbons. In the present article, the properties and constructions of unique minimal conjugated circuits and pairs of minimal conjugated circuits of a ring s in a benzenoid hydrocarbon B are investigated. An analytical expression for the count of LM-conjugated circuits of B is given which is based on the counts of Kekulé structures of selected subgraphs of B. By using the method, the LMC expression of any benzenoid hydrocarbon can be obtained. © 1996 John Wiley & Sons, Inc.     

Wiener indices of trees and monocyclic graphs with given bipartition

The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. It has found various applications in chemical research. We determine the minimum and the maximum Wiener indices of trees with given bipartition and the minimum Wiener index of monocyclic graphs with given bipartition, respectively. We also characterize the graphs whose Wiener indices attain these values. © 2011 Wiley Periodicals, Inc. Int J Quantum Chem, 2012     

On isospectral benzenoid graphs

The recently Proposed procedure [5] for the construction of isospectral benzenoid graphs has been examined in detail. Necessary and sufficient conditions for the construction of isospectral benzenoid graphs with isomorphicH-graphs are formulated. The inapplicability of the Procedure for the construction of isospectral benzenoid graphs with an even number of vertices has been proven.     

Growth in catacondensed benzenoid graphs

The generating function of the sequence counting the number of graph vertices at a given distance from the root is called the spherical growth function of the rooted graph. The vertices farthest from the root form an induced subgraph called the distance-residual graph. These mathematical notions are applied to benzenoid graphs which are used in graph theory to represent benzenoid hydrocarbons. An algorithm for calculating the growth in catacondensed benzenoids is presented, followed by some examples.     

Wiener numbers of benzenoid hydrocarbons: two theorems

Two exact results on the Wiener numbers of catacondensed benzenoid hydrocarbons are obtained. All catacondensed isomers have Wiener numbers congruent modulo 8. Among unbranched catacondensed systems, helicenes have the minimum and linear polyacenes the maximum Wiener number.     

The evaluation of the eighth moment for benzenoid graphs

Summary The evaluation of the eighth moment of the adjacency matrix of benzenoid graphs is considered. It is found that the eighth moment can be expressed in terms of 7 graphical invariants. By this we extend the recently obtained results of Hall [1] and Dias [2].     

Wiener, hyper-Wiener, detour and hyper-detour indices of bridge and chain graphs

Given a collection of connected graphs one may build bridge and chain graphs out of them. In this paper it is shown how the Wiener, hyper-Wiener, detour and hyper-detour indices for bridge and chain graphs are determined from the respective indices of the individual graphs. The results obtained are illustrated by some examples.     

Analytical approach to very large benzenoid polymers

We consider rigorous evaluation of conjugated-circuit resonance energies for families of structurally related benzenoid hydrocarbons of increasing size. Local and global aromatic properties of such molecules are investigated with particular interest in modeling high polymers. Using the algebra of large numbers, exact formulas for contributions from individual benzene rings of polymers with up to 25,000 repeating units (close to half a million carbon atoms) were derived. All arithmetic procedures were carried out in terms of whole numbers retaining all digits, of which there were sometimes more than 10⁵. © 1995 by John Wiley & Sons, Inc.     

Comparability graphs and electronic spectra of condensed benzenoid hydrocarbons

A systematic topological approach to the search for regularities in molecular properties has been proposed on the basis of the so-called comparability graphs of isomeric classes of molecules. It is shown that the ordering of the isomeric benzenoid hydrocarbons in the comparability graphs coincides with that of the longest wavelenght in the p band of their electronic spectra.     

k-resonant benzenoid systems and k-cycle resonant graphs.

A benzenoid system (or hexagonal system) H is said to be k-resonant if, for 1 < or = t < or = k, any t disjoint hexagons of H are mutually resonant; that is, there is a Kekule structure (or perfect matching) K of H such that each of the k hexagons is an K-alternating hexagon. A connected graph G is said to be k-cycle resonant if, for 1 < or = t < or = k, any t disjoint cycles in G are mutually resonant. The concept of k-resonant benzenoid systems is closely related to Clar's aromatic sextet theory, and the concept of k-cycle resonant graphs is a natural generalization of k-resonant benzenoid systems. Some necessary and sufficient conditions for a benzenoid system (respectively a graph) to be k-resonant (respectively k-cycle resonant) have been established. In this paper, we will give a survey on investigations of k-resonant benzenoid systems and k-cycle resonant graphs.     

Isospectral benzenoid graphs with an odd number of vertices

A procedure for construction of isospectral pairs of benzenoid graphs is described. It is based on the Heilbronner wrapping procedure for construction of isospectral bipartite graphs. Only isospectral pairs having an odd number of vertices could be produced (the smallest among them has 33 vertices and 9 hexagons). Thus, the conjecture announced by Cioslowski is partially disproved.     

Generalized Wiener indices of zigzagging pentachains

The “pentachains” studied in this paper are graphs formed of concatenated 5-cycles. Explicit formulas are obtained for the Schultz and modified Schultz indices of these graphs, as well as for generalizations of these indices. In the process we give a more refined version of the procedure that earlier was reported for the ordinary Wiener index.     

Mostar indices of carbon nanostructures and circumscribed donut benzenoid systems

On the great success of bond-additive topological indices such as Szeged, Padmakar-Ivan, Zagreb, and irregularity measures, yet another index, the Mostar index, has been introduced recently as a quantitative refinement of the distance nonbalancedness and also a peripherality measure in molecular graphs and networks. In this direction, we introduce other variants of bond-additive indices, such as edge-Mostar and total-Mostar indices. The present article explores a computational technique for Mostar, edge-Mostar, and total-Mostar indices with respect to the strength-weighted parameters. As an application, these techniques are applied to compute the three indices for the family of coronoid and carbon nanocone structures.     

Generalized Wiener indices in hexagonal chains

The Wiener index, or the Wiener number, also known as the “sum of distances” of a connected graph, is one of the quantities associated with a molecular graph that correlates nicely to physical and chemical properties, and has been studied in depth. An index proposed by Schultz is shown to be related to the Wiener index for trees, and Ivan Gutman proposed a modification of the Schultz index with similar properties. We deduce a similar relationship between these three indices for catacondensed benzenoid hydrocarbons (graphs formed of concatenated hexagons, or hexagonal chains, or sometimes acenes). Indeed, we may define three families of generalized Wiener indices, which include the Schultz and Modified Schultz indices as special cases, such that similar explicit formulae for all generalized Wiener indices hold on hexagonal chains. We accomplish this by first giving a more refined proof of the formula for the standard Wiener index of a hexagonal chain, then extending it to the generalized Wiener indices via the notion of partial Wiener indices. Finally, we discuss possible extensions of the result. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2006     

Wiener polynomials of some chemically interesting graphs

The chemist Harold Wiener found ??(G), the sum of distances between all pairs of vertices in a connected graph G, to be useful as a predictor of certain physical and chemical properties. The q‐analogue of ??, called the Wiener polynomial ??(G; q), is also useful, but it has few existing useful formulas. We will evaluate ??(G; q) for certain graphs G of chemical interest. © 2004 Wiley Periodicals, Inc. Int J Quantum Chem, 2004     

Hamiltonian circuits,Hamiltonian paths and branching graphs of benzenoid systems

A benzenoid systemH is a finite connected subgraph of the infinite hexagonal lattice with out cut bonds and non-hexagonal interior faces. The branching graphG ofH consists of all vertices ofH of degree 3 and bonds among them. In this paper, the following results are obtained:

1. A necessary condition for a benzenoid system to have a Hamiltonian circuit.
2. A necessary and sufficient condition for a benzenoid system to have a Hamiltonian path.
3. A characterization of connected subgraphs of the infinite hexagonal lattice which are branching graphs of benzenoid systems.
4. A proof that if a disconnected subgraph G of the infinite hexagonal lattice given along with the positions of its vertices is the branching graph of a benzenoid system H, then H is unique.