Iranian Journal of Mathematical Chemistry

A salt metathesis reaction is a chemical process involving the exchange of bonds between two reacting chemical species, which results in the creation of products with similar or identical bonding affiliations. Hyperstructure theory is studied from the theoretical point of view and for its applications. In this paper, we provide some examples of hyperstructures associated with salt metathesis reactions, and we observe that these chemical reactions are examples of the phenomena when composition of two elements is a set of elements.

Dariush Heidari

Davood Mazaheri

Bijan Davvaz

Iranian journal of mathemathical chemistry./Iranian journal of mathemathical chemistry

Chemical Salt Reactions as Algebraic Hyperstructures

化学盐反应作为代数超结构

In this paper, we obtain M-polynomial of some graph operations and cy- cle related graphs. As an application, we compute M-polynomial of some nanostruc- tures viz., TUC4C8[p; q] nanotube, TUC4C8[p; q] nanotorus, line graph of subdivision graph of TUC4C8[p; q] nanotube and TUC4C8[p; q] nanotorus, V-tetracenic nanotube and V-tetracenic nanotorus. Further, we derive some degree based topological indices from the obtained polynomials.

Bommanahal Basavanagoud

Anand Prakash Barangi

Praveen Jakkannavar

M-polynomial of some Graph Operations and Cycle Related Graphs

一些图操作和与圈相关的图的M-多项式

In this paper, we present a new class of hybrid methods for the numerical solution of first order ordinary differential equations (ODEs). The accuracy and stability properties of the new methods are investigated. In the final section, we apply new hybrid methods to solve two stiff chemical problems such as Roberston problem.

Mohammad Mehdizadeh Khalsaraei

Ali Shokri

Maryam Molayi

The New High Approximation of Stiff Systems of First Order IVPs Arising from Chemical Reactions by k-step L-stable Hybrid Methods

化学反应中一阶初值刚性系统的新高阶近似：k步L稳定混合方法

The Wiener index W and the edge-Wiener index W_e of G are defined as the sum of distances between all pairs of vertices in G and the sum of distances between all pairs of edges in G, respectively. In this paper, we identify the four trees, with the first through fourth greatest Wiener and edge-Wiener index among all trees of order n ≥ 10.

Ali Ghalavand

Trees with the Greatest Wiener and Edge-Wiener Index

具有最大Wiener指数和边Wiener指数的树

Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier‎. ‎This paper applies an evolutionary optimization scheme‎, ‎inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategies‎, ‎to find approximate solutions for multi-objective optimal control problems (MOCPs)‎. ‎The desired control function may be subjected to severe changes over a period of time‎. ‎In response to deficiency‎, ‎the process of dispersal has been modified in the MOIWO‎. ‎This modification will increase the exploration power of the weeds and reduces the search space gradually during the iteration process‎. ‎ ‎The performance of the proposed algorithm ‎is compared with conventional Non-dominated Sorting Genetic Algorithm (NSGA-II) and Non-dominated Sorting Invasive Weed Optimization (NSIWO) algorithm‎.The results show that the proposed algorithm has better performance than others in terms of computing time‎, ‎convergence rate and diversity of solutions on the Pareto ‎frontier.

Gholam Hosein Askarirobati

Akbar Hashemi Borzabadi

Aghileh Heydari

Solving Multi-objective Optimal Control Problems of chemical processes using Hybrid Evolutionary Algorithm

使用混合进化算法解决化工过程多目标最优控制问题

The modified first Zagreb connection index ZC∗1 for a graph G is defined as ZC∗1 (G) = sum v∈V (G) dvτv , where dv is the degree of the vertex v and τv denotes the connection number of v (that is, the number of vertices at the distance 2 from the vertex v). Let Tn,α be the class of trees with order n and matching number α such that n > 2α−1. In this paper, we obtain the lower bounds on the modified first Zagreb connection index of trees belonging to the class Tn,α, for 2α − 1 < n < 3α + 2.

Sadia Noureen

Akhlaq Ahmad Bhatti

On the trees with given matching number and the modified first Zagreb connection index

关于具有给定匹配数和修正第一Zagreb连接指数的树

The aim of this paper is to give an upper and lower bounds for the first and second Zagreb indices of quasi bicyclic graphs. For a simple graph G, we denote M1(G) and M2(G), as the sum of deg2(u) overall vertices u in G and the sum of deg(u)deg(v) of all edges uv of G, respectively. The graph G is called quasi bicyclic graph if there exists a vertex x ∈ V (G) such that G−x is a connected bicyclic graph. The results mentioned in this paper, are mostly new or an improvement of results given by authors for quasi unicyclic graphs in [1].

Majid Aghel

Ahmad Erfanian

Tayebeh Dehghan-Zadeh

Upper and Lower Bounds for the First and Second Zagreb Indices of Quasi Bicyclic Graphs

拟双圈图的第一和第二Zagreb指数的上界和下界

The Gutman index and Schultz index are two topological indices‎. ‎In this paper‎, ‎we first give exact formulae for the expected values of the Gutman index and Schultz index of random phenylene chains‎, ‎and we will also get the average values of the Gutman index and Schultz index in phenylene chains.‎

Lina Wei

Hong Bian

Haizheng Yu

Xiaoying Yang

The Gutman Index and Schultz Index in the Random Phenylene Chains

随机苯撑链中的古特曼指数与舒尔茨指数

Let $G$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. For a subset $S$ of $V(G)$, the Steiner distance $d(S)$ of $S$ is the minimum size of a connected subgraph whose vertex set contains $S$. For an integer $k$ with $2 le k le n - 1$, the $k$-th Steiner Wiener index of a graph $G$ is defined as $SW_k(G) = sum_{substack{Ssubseteq V(G) |S|=k}}d(S)$. In this paper, we present exact values of the $k$-th Steiner Wiener index of complete $m$-ary trees by using inclusion-excluision principle for various values of $k$.

Mesfin Masre Legese

Steiner Wiener Index of Complete m-Ary Trees

完全m元树的Steiner Wiener指数

In this paper‎, ‎the characteristic polynomial and the spectrum of the terminal distance matrix for some Kragujevac trees is computed. ‎As Application‎, ‎we obtain an upper bound and a lower bound for the spectral radius of the terminal distance matrix of the Kragujevac trees‎.

Abbas Heydari

On the Characteristic Polynomial and Spectrum of the Terminal Distance Matrix of Kragujevac Trees

关于克拉古耶瓦茨树的终端距离矩阵的特征多项式和谱

短名
Journal Impact	0.81
国际分区	CHEMISTRY, MULTIDISCIPLINARY(Q4)

涉及主题	数学计算机科学组合数学离散数学物理理论计算机科学图形化学量子力学数学分析工程类计算化学拓扑指数生物程序设计语言顶点（图论）有机化学
出版信息	出版商: University of Kashan，出版周期: ，期刊类型: journal，开源期刊: 否
基本数据	创刊年份: 2019，原创研究文献占比: 94.74%，自引率:10.00%， Gold OA占比: 0.00%

Iranian Journal of Mathematical Chemistry

期刊引文格式

有 1 位以上作者的期刊

有 2 位作者的期刊

有 3 位作者的期刊

有 5 位以上作者的期刊

书籍引用格式

学位论文引用格式

网页引用格式

专利引用格式

手工熬夜修改参考文献？研飞自动匹配期刊，一键轻松成稿，支持 Word/WPS

投稿经验分享