The PI index of phenylenes

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., PI(G) = ∑ _e∈E(G)[n _eu (e|G) + n _ev (e|G)], 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 phenylenes is given, and a simple relation is established between the PI index of a phenylene and of the corresponding hexagonal squeeze.     

Novel PI Indices of Hexagonal Chains

Problems don't hung on trees. Formulation of a good problem is often the most important part of a (theoretical) research. New problems usually arise when you try to solve old problems. Ivan Gutman, June 27, 1995.The Padmakar–Ivan (PI) index of hexagonal chains (i.e., the molecular graphs of unbranched catacondensed benzenoid hydrocarbons) is examined. The index PI is a graph invariant defined as the summation of the sums of edges of n _eu and n _ev over all the edges of connected graph G, where n _eu is the number of edges of G lying closer to u than to v and n _ev is the number of edges of G lying closer to v than to u. An efficient calculation of formula for PI for hexagonal chains are put forward.     

A Method of Computing the PI Index of Benzenoid Hydrocarbons Using Orthogonal Cuts

The Padmakar–Ivan (PI) index of a graph G is defined as PI , where for edge e=(u,v) are the number of edges of G lying closer to u than v, and is the number of edges of G lying closer to v than u and summation goes over all edges of G. The PI index is a Wiener–Szeged-like topological index developed very recently. In this paper, we describe a method of computing PI index of benzenoid hydrocarbons (H) using orthogonal cuts. The method requires the finding of number of edges in the orthogonal cuts in a benzenoid system (H) and the edge number of H – a task significantly simpler than the calculation of PI index directly from its definition. On the eve of 70th anniversary of both Prof. Padmakar V. Khadikar and his wife Mrs. Kusum Khadikar.     

The (n,n)-graphs with the first three extremal Wiener indices

Let G = (V, E) be a simple connected graph with vertex set V and edge set E. The Wiener index W(G) of G is the sum of distances between all pairs of vertices in G, i.e., , where d _G (u, v) is the distance between vertices u and v in G. In this paper, we first give a new formula for calculating the Wiener index of an (n,n)-graph according its structure, and then characterize the (n,n)-graphs with the first three smallest and largest Wiener indices by this formula.     

Sharp upper bounds for total π-electron energy of alternant hydrocarbons

The energy E(G) of a graph G is defined as the sum of the absolute values of all the eigenvalues of the adjacency matrix of the graph G. This quantity is used in chemistry to approximate the total π-electron energy of molecules and in particular, in case G is bipartite, alternant hydrocarbons. In this paper, we show that if G = (V ₁, V ₂; E) is a bipartite graph with edges and , then

Sharp Bounds for the Second Zagreb Index of Unicyclic Graphs

The second Zagreb index M ₂(G) of a (molecule) graph G is the sum of the weights d(u)d(v) of all edges uv of G, where d(u) denotes the degree of the vertex u. In this paper, we give sharp upper and lower bounds on the second Zagreb index of unicyclic graphs with n vertices and k pendant vertices. From which, and C _n have the maximum and minimum the second Zagreb index among all unicyclic graphs with n vertices, respectively.     

Ordering chemical unicyclic graphs by Wiener polarity index

Suppose G is a chemical graph with vertex set V(G). Define D(G) = {{u, v} ⊆ V (G) | d _G (u, v) = 3}, where d _G (u, v) denotes the length of the shortest path between u and v. The Wiener polarity index of G, W _p (G), is defined as the size of D(G). In this article, an ordering of chemical unicyclic graphs of order n with respect to the Wiener polarity index is given.     

On the connectivity index of trees

The connectivity index χ₁(G) of a graph G is the sum of the weights d(u)d(v) of all edges uv of G, where d(u) denotes the degree of the vertex u. Let T(n, r) be the set of trees on n vertices with diameter r. In this paper, we determine all trees in T(n, r) with the largest and the second largest connectivity index. Also, the trees in T(n, r) with the largest and the second largest connectivity index are characterized. Mei Lu is partially supported by NNSFC (No. 10571105).     

On the Randić Index of Quasi-tree Graphs

The Randić index of an organic molecule whose molecular graph is G is the sum of the weights (d(u)d(v))^−1/2 of all edges uv of G, where d(u) and d(v) are the degrees of the vertex u and v in G. A graph G is called quasi-tree, if there exists such that G − u is a tree. In the paper, we give sharp lower and upper bounds on the Randić index of quasi-tree graphs. Mei Lu: Partially supported by NSFC (No. 10571105).     

Hosoya polynomials of TUC4C8(S) nanotubes

The Hosoya polynomial of a chemical graph G is , where d _G (u, v) denotes the distance between vertices u and v. In this paper, we obtain analytical expressions for Hosoya polynomials of TUC₄C₈(S) nanotubes. Accordingly, the Wiener index, obtained by Diudea et al. (MATCH Commun. Math. Comput. Chem. 50, 133–144, (2004)), and the hyper-Wiener index are derived. This work is supported by the Fundamental Research Fund for Physics and Mathematic of Lanzhou University (Grant No. LZULL200809).     

New upper bounds on Zagreb indices

The first Zagreb index M ₁(G) is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index M ₂(G) is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying molecular graph G. In this paper we obtain an upper bound on the first Zagreb index M ₁(G) of G in terms of the number of vertices (n), number of edges (m), maximum vertex degree (Δ₁), second maximum vertex degree (Δ₂) and minimum vertex degree (δ). Using this result we find an upper bound on M ₂(G). Moreover, we present upper bounds on and in terms of n,  m, Δ₁, Δ₂, δ, where denotes the complement of G.     

Maximum Randić index on Trees with <Emphasis Type="Italic">k</Emphasis>-pendant Vertices

The Randić index of an organic molecule whose molecular graph is G is the sum of the weights (d(u)d(v))^−1/2 of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G. Let T be a tree with n vertices and k pendant vertices. In this paper, we give a sharp upper bound on Randić index of T.     

Hosoya polynomials of TUC4C8(R) nanotubes

For a connected graph G, the Hosoya polynomial of G is defined as H(G, x) = ∑_{u,v}?V(G)x^{d(u, v)}, where V(G) is the set of all vertices of G and d(u,v) is the distance between vertices u and v. In this article, we obtain analytical expressions for Hosoya polynomials of TUC₄C₈(R) nanotubes. Furthermore, the Wiener index and the hyper‐Wiener index can be calculated. © 2008 Wiley Periodicals, Inc. Int J Quantum Chem, 2009     

Some upper bounds for the energy of graphs

Let G = (V,E) be a graph with n vertices and e edges. Denote V(G) = {v ₁,v ₂,...,v _n }. The 2-degree of v _i , denoted by t _i , is the sum of degrees of the vertices adjacent to . Let σ _i be the sum of the 2-degree of vertices adjacent to v _i . In this paper, we present two sharp upper bounds for the energy of G in terms of n, e, t _i , and σ _i , from which we can get some known results. Also we give a sharp bound for the energy of a forest, from which we can improve some known results for trees.     

Hosoya index of unicyclic graphs with prescribed pendent vertices

The Hosoya index z(G) of a (molecular) graph G is defined as the total number of subsets of the edge set, in which any two edges are mutually independent, i.e., the total number of independent-edge sets of G. By G(n, l, k) we denote the set of unicyclic graphs on n vertices with girth and pendent vertices being resp. l and k. Let be the graph obtained by identifying the center of the star S _n-l+1 with any vertex of C _l . By we denote the graph obtained by identifying one pendent vertex of the path P _n-l-k+1 with one pendent vertex of . In this paper, we show that is the unique unicyclic graph with minimal Hosoya index among all graphs in G(n, l, k).      

On the Randić Index of Unicyclic Conjugated Molecules

The Randić index R(G) of a graph G is the sum of the weights of all edges uv of G, where d(u) denotes the degree of the vertex u. In this paper, we first present a sharp lower bound on the Randić index of conjugated unicyclic graphs (unicyclic graphs with perfect matching). Also a sharp lower bound on the Randić index of unicyclic graphs is given in terms of the order and given size of matching.     

On the Randić Index of Acyclic Conjugated Molecules

The Randić index of an organic molecule whose molecular graph is G is the sum of the weights (d(u)d(v))^−1/2 of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G. We give a sharp lower bound on the Randić index of conjugated trees (trees with a perfect matching) in terms of the number of vertices. A sharp lower bound on the Randić index of trees with a given size of matching is also given Mei Lu: Partially supported by NNSFC (No. 60172005) Lian-zhu Zhang: Partially supported by NNSFC (No. 10271105) Feng Tian: Partially supported by NNSFC (No. 10431020)     

Extremal (<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">n</Emphasis> + 1)-graphs with respected to zeroth- order general Randić index

A (n, n + 1)-graph G is a connected simple graph with n vertices and n + 1 edges. If d _v denotes the degree of the vertex v, then the zeroth-order general Randić index of the graph G is defined as , where α is a real number. We characterize, for any α, the (n,n + 1)-graphs with the smallest and greatest zeroth-order general Randić index.     

Unicycle Graphs with Maximum Generalized Topological Indices

Let G be an unicycle graph and d _v the degree of the vertex v. In this paper, we investigate the following topological indices for an unicycle graph , , where m ≥ 2 is an integer. All unicycle graphs with the largest values of the three topological indices are characterized. This research is supported by the National Natural Science Foundation of China(10471037)and the Education Committee of Hunan Province(02C210)(04B047).     

Unicycle graphs with extremal Merrifield–Simmons Index

The Merrifield–Simmons index f(G) of a (molecular) graph G is defined as the number of subsets of the vertex set, in which any two vertices are non-adjacent, i.e., the number of independent-vertex sets of G. By we denote the set of unicycle graphs in which the length of its unique cycle is k. In this paper, we investigate the Merrifield–Simmons index f(G) for an unicycle graph G in . Unicycle graphs with the largest or smallest Merrifield–Simmons index are uniquely determined.