فهرست مطالب

Mathematical Chemistry - Volume:6 Issue:2, 2015
  • Volume:6 Issue:2, 2015
  • تاریخ انتشار: 1394/07/02
  • تعداد عناوین: 10
|
  • S. Klavzar, E. Deutsch Pages 93-102
    Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular case to the single problem of determining the $M$-polynomial. The new approach is also illustrated with examples.
    Keywords: degree, based topological index, Zagreb index, Randic index, graph polynomial
  • I. Gutman Pages 103-108
    The topological indices, defined as the sum of contributions of all pairs of vertices (among which are the Wiener, Harary, hyper–Wiener indices, degree distance, and many others), are expressed in terms of contributions of edges and pairs of edges.
    Keywords: topological index, molecular graph, edge, decomposition (of topologica, l index), coindex
  • S. Masoum, S. Heshmat Pages 109-119
    Green tea is considered as a dietary source of antioxidant nutrients, which acts upon human health. Green tea leaves contain three main components in the form of simple hydroxy benzoic acids such as gallic acid, propyl gallate and xanthic bases (caffeine), have been reported to prevent or delay a number of degenerative diseases and act mainly upon the central nervous system and stimulating wakefulness. Therefore, it is important to establish a simple and reliable analytical method for determination of these compounds in the presence of unexpected interferences in the green tea sample.In this research, a rapid and sensitive method was used for the direct determination of gallic acid and caffeine in green tea that is based on excitation-emission data using chemometric approaches. Multi-way chemometric models can be used to study such data, providing estimates of the spectra and concentration profiles of the underlying chemical analytes. A high percentage of recoveries for the spiked green tea for gallic acid (i.e. 96.15 %-109.78 %) and caffeine (i.e. 93.75% -101.57%) indicate the high accuracies of the proposed calibration methods for the assessment of gallic acid and caffeine in green tea.
    Keywords: Green tea, Spectrofluorimetric analysis, Excitation, emission data, Three, way chemometric methods
  • M. Eliasi Pages 121-128
    The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
    Keywords: Total irregularity index, Gini index, Majorization, Trees, Unicyclic graphs
  • D. Rupnik Poklukar, J. Zerovnik Pages 129-135
    Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain conditions the bonds can break with certain probability. This is fully taken into account in quantum chemistry. In the model considered here, probabilistic nature is taken into account and at the same time the conceptual simplicity of the discrete graph theoretical model is preserved. Here we extend previous studies by deriving a formula for the reliability Wiener number of a Cartesian product of graphs.
    Keywords: reliability Wiener number, Wiener index, Cartesian product of graphs
  • W. Gao, Y. Gao Pages 137-143
    In theoretical chemistry, -modified Wiener index is a graph invariant topological index to analyze the chemical properties of molecular structure. In this note, we determine the minimum -modified Wiener index of graph with fixed connectivity or edge-connectivity. Our results also present the sufficient and necessary condition for reaching the lower bound.
    Keywords: Chemical graph theory, , modified Wiener index, connectivity, edge, connectivity
  • A. Shokri, A. A. Shokri, Sh. Mostafavi, H. Saadat Pages 145-161
    In this paper, we present a new two-step trigonometrically fitted symmetric Obrechkoff method. The method is based on the symmetric two-step Obrechkoff method, with eighth algebraic order, high phase-lag order and is constructed to solve IVPs with periodic solutions such as orbital problems. We compare the new method to some recently constructed optimized methods from the literature. The numerical results obtained by the new method for some problems show its superiority in efficiency, accuracy and stability.
    Keywords: Obrechkoff methods, Trigonometrically, fitting, Initial value problems, Symmetric multistep methods, oscillating solution
  • A. Parvan-Moldovan, M. V. Diudea Pages 163-168
    Hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.
    Keywords: graph, n, cube, hyper, tube, hyper, torus, n, dimensional space
  • M. Namjoo, S. Zibaei Pages 169-184
    In this paper, we introduce fractional-order into a model of HIV-1 infection of CD4^+ T--cells. We study the effect of the changing the average number of viral particles $N$ with different sets of initial conditions on the dynamics of the presented model. The nonstandard finite difference (NSFD) scheme is implemented to study the dynamic behaviors in the fractional--order HIV-1 infection model. Numerical results show that the NSFD approach is easy to be implemented and accurated when applied to fractional-order HIV-1 infection model.
    Keywords: HIV, 1 modelý, ýNonstandard finite difference schemeý, ýFractional differential equationsý, ýGrunwald, Letnikov derivativeý, ýStability
  • Open problems for equienergetic graphs
    I. Gutman Pages 185-187
    The energy of a graph is equal to the sum of the absolute values of its eigenvalues. Two graphs of the same order are said to be equienergetic if their energies are equal. We point out the following two open problems for equienergetic graphs. (1) Although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known how to systematically construct any such pair. (2) If by numerical calculation one finds that two non-cospectral graphs seem to be equienergetic, in the general case no method is known for proving that this indeed is the case.
    Keywords: graph energy, equienergetic graphs, spectrum (of graph)