Unicyclic Graphs Possessing Kekulé Structures with Minimal Energy

Unicyclic graphs possessing Kekulé structures with minimal energy are considered. Let n and l be the numbers of vertices of graph and cycle C _l contained in the graph, respectively; r and j positive integers. It is mathematically verified that for and l = 2r + 1 or has the minimal energy in the graphs exclusive of , where is a graph obtained by attaching one pendant edge to each of any two adjacent vertices of C ₄ and then by attaching n/2 − 3 paths of length 2 to one of the two vertices; is a graph obtained by attaching one pendant edge and n/2 − 2 paths of length 2 to one vertex of C ₃. In addition, we claim that for has the minimal energy among all the graphs considered while for has the minimal energy.      

On minimal energies of trees of a prescribed diameter

The energy of a graph is defined as the sum of the absolute values of all the eigenvalues of the graph. Let denote the set of trees on n vertices and diameter d, . Yan and Ye [Appl. Math. Lett. 18 (2005) 1046–1052] have recently determined the unique tree in with minimal energy. In this article, the trees in with second-minimal energy are characterizedAMS Subject Classification: 05C50, 05C35     

Unicyclic Hückel molecular graphs with minimal energy

The minimal energy of unicyclic Hückel molecular graphs with Kekulé structures, i.e., unicyclic graphs with perfect matchings, of which all vertices have degrees less than four in graph theory, is investigated. The set of these graphs is denoted by such that for any graph in , n is the number of vertices of the graph and l the number of vertices of the cycle contained in the graph. For a given n(n ≥ 6), the graphs with minimal energy of have been discussed. MSC 2000: 05C17, 05C35     

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

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.     

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

On zeroth-order general Randić index of conjugated unicyclic graphs

Let G be a graph and d _v denote the degree of the vertex v in G. The zeroth-order general Randić index of a graph is defined as where α is an arbitrary real number. In this paper, we investigate the zeroth-order general Randić index of conjugated unicyclic graphs G (i.e., unicyclic graphs with a perfect matching) and sharp lower and upper bounds are obtained for depending on α in different intervals.     

On the Ordering of a Class of Graphs with Respect to their Matching Numbers

Based on the number of k-matching m(G,k) of a graph G, Gutman and Zhang introduced an order relation of graphs: for graphs G ₁ and G ₂, if m(G ₁,k) ≥ m(G ₂,k) for all k. The order relation has important applications in comparing Hosaya indices and energies of molecular graphs and has been widely studied. Especially, Gutman and Zhang gave complete orders of six classes of graphs with respect to the relation . In this paper, we consider a class of graphs with special structure, which is a generalization of a class of graphs studied by Gutman and Zhang. Some order relations in the class of graphs are given, and the maximum and minimum elements with respect to the order relation are determined. The new results can be applied to order some classes of graphs by their matching numbers.     

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.     

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.     

Characterizations for Some Types of DNA Graphs

Vertex induced subgraphs of directed de Bruijn graphs with labels of fixed length k and over α letter alphabet are (α,k)-labelled. DNA graphs are (4,k)-labelled graphs. Pendavingh et al. proved that it is NP-hard to determine the smallest value α _k (D) for which a directed graph D can be (α _k (D),k)-labelled for any fixed . In this paper, we obtain the following formulas: and for cycle C _n and path P _n . Accordingly, we show that both cycles and paths are DNA graphs. Next we prove that rooted trees and self-adjoint digraphs admit a (Δ,k)-labelling for some positive integer k and they are DNA graphs if and only if Δ ≤ 4, where Δ is the maximum number in all out-degrees and in-degrees of such digraphs.     

Extremal Polyomino Chains on k-matchings and k-independent Sets

Denote by the set of polyomino chains with n squares. For any , let m _k (T _n ) and i _k (T _n ) be the number of k-matchings and k-independent sets of T _n , respectively. In this paper, we show that for any polyomino chain and any , and , with the left equalities holding for all k only if T _n =L _n , and the right equalities holding for all k only if T _n =Z _n , where L _n and Z _n are the linear chain and the zig-zag chain, respectively. This work is supported by NNSFC (10371102).     

On the path-Zagreb matrix

The definition of the path-Zagreb matrix for (chemical) trees PZ and its generalization to any (molecular) graph is presented. Additionally, the upper bound of , where G _n is a graph with n vertices is given.     

On the largest eigenvalues of trees with perfect matchings

Let λ₁ (G) and Δ (G), respectively, denote the largest eigenvalue and the maximum degree of a graph G. Let be the set of trees with perfect matchings on 2m vertices, and . Among the trees in , we characterize the tree which alone minimizes the largest eigenvalue, as well as the tree which alone maximizes the largest eigenvalue when . Furthermore, it is proved that, for two trees T ₁ and T ₂ in (m≥ 4), if and Δ (T ₁) > Δ (T ₂), then λ₁ (T ₁) > λ₁ (T ₂).     

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

Reaction graphs and a construction of reaction networks

Summary A general definition of reaction graphs is presented. For a pair of isomeric molecular graphs and , related by a chemical transformation , the reaction graph is determined using a maximal common subgraph defined for vertex mapping . A binary operation defined for graphs constructed over the same vertex set enables us to decompose the reaction graph into the sum of prototype reaction graphs. A decomposition of an overall reaction graph can be advantageously used for the construction of a reaction network. An oriented path in this network beginning at and ending at corresponds to a breakdown of the transformation into a sequence of intermediates.     

An Upper Bound for the Clar Number of Fullerene Graphs

A fullerene graph is a three-regular and three-connected plane graph exactly 12 faces of which are pentagons and the remaining faces are hexagons. Let F _n be a fullerene graph with n vertices. The Clar number c(F _n ) of F _n is the maximum size of sextet patterns, the sets of disjoint hexagons which are all M-alternating for a perfect matching (or Kekulé structure) M of F _n . A sharp upper bound of Clar number for any fullerene graphs is obtained in this article: . Two famous members of fullerenes C₆₀ (Buckministerfullerene) and C₇₀ achieve this upper bound. There exist infinitely many fullerene graphs achieving this upper bound among zigzag and armchair carbon nanotubes.     

Thermodynamic properties of the ternary oxides in the Eu–Ru–O system by using solid-state electrochemical cells

The Gibbs free energies of formation of Eu₃RuO₇(s) and Eu₂Ru₂O₇(s) have been determined using solid-state electrochemical technique employing oxide ion conducting electrolyte. The reversible electromotive force (e.m.f.) of the following solid-state electrochemical cells have been measured:

On the Permanental Polynomials of Some Graphs

Let G be a simple graph with adjacency matrix A(G) and (G,x) the permanental polynomial of G. Let G × H denotes the Cartesian product of graphs G and H. Inspired by Kleins idea to compute the permanent of some matrices (Mol. Phy. 31 (3) (1976) 811–823), in this paper in terms of some orientation of graphs we study the permanental polynomial of a type of graphs. Here are some of our main results.1.If G is a bipartite graph containing no subgraph which is an even subdivision of K _2,3, then G has an orientation G ^e such that (G,x) = det (xI-A(G ^e )), where A(G ^e ) denotes the skew adjacency matrix of G ^e.2.Let G be a 2-connected outerplanar bipartite graph with n vertices. Then there exists a 2-connected outerplanar bipartite graph with 2n+2 vertices such that (G,x) is a factor of .3.Let T be an arbitrary tree with n vertices. Then , where ₁ , ₂ , ..., _n are the eigenvalues of T.