Iranian Journal of Mathematical Chemistry
Year:2018 | Volume:9 | Issue:1 |Papers Count:8

Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Rhombellane structures are introduced and their design and topological properties are detailed.

The theoretical treatment of cycle-effects on total 􀟨-electron energy, mainly elaborated by Nenad Trinajstić and his research group, is restated in a general and more formal manner. It enables to envisage several other possible ways of measuring the cycle-effects and points at further directions of research.

The 􀝊-tuple of Laplacian characteristic values of a graph is majorized by the conjugate sequence of its degrees. Using that result we find a collection of general inequalities for a number of Laplacian indices expressed in terms of the conjugate degrees, and then with a maximality argument, we find tight general bounds expressed in terms of the size of the vertex set n and the average degree 􀝀 􀯀 = 2|􀜧 |/􀝊 . We also find some particular tight bounds for some classes of graphs in terms of customary graph parameters.

The fractal degree of adsorption on the carbon nanotube has been investigated. The fractal-like Langmuir kinetics model has been used to obtain the fractal degree of ion adsorption on carbon nanotube. The behavior of the fractal-like kinetics equation was compared with some famous rate equations like Langmuir, pseudo-first-order and pseudosecond-order equations. It is shown that the kinetic of adsorption onto carbon nanotube can be used to obtain its spectral dimension, successfully.

Let G be a simple graph with vertex set V(G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V(G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.

In this paper, we obtain the upper and lower bounds on the eccentricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.

Let G be a finite and simple graph with edge set E(G). The revised Szeged index is defined as...

Algebraic hyperstructures have many applications in various sciences. The main purpose of this paper is to provide a new application of weak hyperstructures in Chemistry. More precisely, we present three different examples of hyperstructures associated to electrochemical cells. In which we prove that our hyperstructures are Hv-semigroups and we present some interesting results.