Kirchhoff index of linear hexagonal chains

The resistance distance r_ij between vertices i and j of a connected (molecular) graph G is computed as the effective resistance between nodes i and j in the corresponding network constructed from G by replacing each edge of G with a unit resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices. In this work, according to the decomposition theorem of Laplacian polynomial, we obtain that the Laplacian spectrum of linear hexagonal chain L_n consists of the Laplacian spectrum of path P_2n+1 and eigenvalues of a symmetric tridiagonal matrix of order 2n + 1. By applying the relationship between roots and coefficients of the characteristic polynomial of the above matrix, explicit closed‐form formula for Kirchhoff index of L_n is derived in terms of Laplacian spectrum. To our surprise, the Krichhoff index of L_n is approximately to one half of its Wiener index. Finally, we show that holds for all graphs G in a class of graphs including L_n. © 2007 Wiley Periodicals, Inc. Int J Quantum Chem, 2008     

New Nordhaus-Gaddum-type results for the Kirchhoff index

Let G be a connected graph. The resistance distance between any two vertices of G is defined as the net effective resistance between them if each edge of G is replaced by a unit resistor. The Kirchhoff index is the sum of resistance distances between all pairs of vertices in G. Zhou and Trinajstić (Chem Phys Lett 455(1–3):120–123, 2008) obtained a Nordhaus-Gaddum-type result for the Kirchhoff index by obtaining lower and upper bounds for the sum of the Kirchhoff index of a graph and its complement. In this paper, by making use of the Cauchy-Schwarz inequality, spectral graph theory and Foster’s formula, we give better lower and upper bounds. In particular, the lower bound turns out to be tight. Furthermore, we establish lower and upper bounds on the product of the Kirchhoff index of a graph and its complement.     

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.     

Resistance distance and Laplacian spectrum

The resistance distance r _ij between two vertices v _i and v _j of a (connected, molecular) graph G is equal to the resistance between the respective two points of an electrical network, constructed so as to correspond to G, such that the resistance of any two adjacent points is unity. We show how the matrix elements r _ij can be expressed in terms of the Laplacian eigenvalues and eigenvectors of G. In addition, we determine certain properties of the resistance matrix R=||r _ij ||. AcknowledgementsThis research was supported by the Natural Science Foundation of China and Fujian Province, and by the Ministry of Sciences, Technologies and Development of Serbia, within Project no. 1389. The authors thank Douglas J. Klein (Galveston) for useful comments.     

A formula for the Kirchhoff index

We show here that the Kirchhoff index of a network is the average of the Wiener capacities of its vertices. Moreover, we obtain a closed‐form formula for the effective resistance between any pair of vertices when the considered network has some symmetries, which allows us to give the corresponding formulas for the Kirchhoff index. In addition, we find the expression for the Foster's n‐th formula.     

The spread of unicyclic graphs with given size of maximum matchings

The spread s(G) of a graph G is defined as s(G) = max _i,j |λ _i − λ _j |, where the maximum is taken over all pairs of eigenvalues of G. Let U(n,k) denote the set of all unicyclic graphs on n vertices with a maximum matching of cardinality k, and U ^*(n,k) the set of triangle-free graphs in U(n,k). In this paper, we determine the graphs with the largest and second largest spectral radius in U ^*(n,k), and the graph with the largest spread in U(n,k).      

On topological indices of carbon nanocones and nanotori

Let G be a graph with n vertices and d _i is the degree of its ith vertex (d _i is the degree of v _i). In this article, we compute the redefined first Zagreb index, redefined second Zagreb index, redefined third Zagreb index, augmented Zagreb index of graphs carbon nanocones CNC _k[n], and nanotori [C₄C₆C₈(p,q)]. Also, compute the multiplicative redefined first Zagreb index, multiplicative redefined second Zagreb index, multiplicative redefined third Zagreb index, multiplicative augmented Zagreb index of carbon nanocones CNC _k[n], and nanotori [C₄C₆C₈(p,q)].     

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.     

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     

Extremal Wiener and Kirchhoff indices of globular caterpillars

The Wiener and Kirchhoff indices of a graph G are two of the most important topological indices in mathematical chemistry. A graph G is called to be a globular caterpillar if G is obtained from a complete graph K _s with vertex set {v₁,v₂,…, v _s} by attaching n _i pendent edges to each vertex v _i of K _s for some positive integers s and n₁,n₂,…,n _s, denoted by . Let be the set of globular caterpillars with n vertices (). In this article, we characterize the globular caterpillars with the minimal and maximal Wiener and Kirchhoff indices among , respectively.     

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.     

Graphs with maximum connectivity index

Let G be a graph and d_v the degree (=number of first neighbors) of its vertex v. The connectivity index of G is χ=∑ (d_ud_v)^−1/2, with the summation ranging over all pairs of adjacent vertices of G. In a previous paper (Comput. Chem. 23 (1999) 469), by applying a heuristic combinatorial optimization algorithm, the structure of chemical trees possessing extremal (maximum and minimum) values of χ was determined. It was demonstrated that the path P_n is the n-vertex tree with maximum χ-value. We now offer an alternative approach to finding (molecular) graphs with maximum χ, from which the extremality of P_n follows as a special case. By eliminating a flaw in the earlier proof, we demonstrate that there exist cases when χ does not provide a correct measure of branching: we find pairs of trees T, T′, such that T is more branched than T′, but χ(T)>χ(T′). The smallest such examples are trees with 36 vertices in which one vertex has degree 31.     

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.     

Effective resistances for ladder‐like chains

Here, we consider a class of generalized linear chains; that is, the ladder‐like chains as a perturbation of a 2n path by adding consecutive weighted edges between opposite vertices. This class of chains in particular includes a big family of networks that goes from the cycle, unicycle chains up to ladder networks. In this article, we obtain the Green function, the effective resistance, and the Kirchhoff index of ladder‐like chains in terms of the Green function, the effective resistance, and the Kirchhoff index of the path. © 2014 Wiley Periodicals, Inc.     

Common vertex matrix: A novel characterization of molecular graphs by counting

We present a novel matrix representation of graphs based on the count of equal‐distance common vertices to each pair of vertices in a graph. The element (i, j) of this matrix is defined as the number of vertices at the same distance from vertices (i, j). As illustrated on smaller alkanes, these novel matrices are very sensitive to molecular branching and the distribution of vertices in a graph. In particular, we show that ordered row sums of these novel matrices can facilitate solving graph isomorphism for acyclic graphs. This has been illustrated on all undecane isomers C₁₁H₂₄ having the same path counts (total of 25 molecules), on pair of graphs on 18 vertices having the same distance degree sequences (Slater's graphs), as well as two graphs on 21 vertices having identical several topological indices derived from information on distances between vertices. © 2013 Wiley Periodicals, Inc.     

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).     

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.     

Another look at the degree‐Kirchhoff index

Let G be an arbitrary graph with vertex set {1,2, …,N} and degrees d_i ≤ D, for fixed D and all i, then for the index R′(G) = ∑_{i < j}d_id_jR_ij we show that We also show that the minimum of R′(G) over all N‐vertex graphs is attained for the star graph and its value is 2N² ? 5N + 3. © 2010 Wiley Periodicals, Inc. Int J Quantum Chem, 2011     

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.     

Recognizing Kekuléan benzenoid systems byC-P-V path elimination

In this paper, we define the concept of a canonicalP-V pathP(p _i– _i ) on the boundary of a benzenoid systemH, and prove thatH has a Kekulé structure if and only ifH-P(p _i–v _i) has a Kekulé structure, whereH-P(p _i–v _i) is the graph obtained fromH by deleting the vertices onP(p _i–v _i) . It is also proved that there are at least two canonicalP-V paths in a benzenoid system. By the above results, we give an efficient and simple algorithm, called the canonicalP-V (C-P-V) path elimination, for determining whether or not a given benzenoid systemH has Kekulé structures. IfH is Kekuléan, the algorithm can find a Kekulé structure ofH.Supported by NSFC.