发布求助
文献互助 智能选刊 最新文献

Iranian journal of mathematical chemistry最新文献

筛选
英文 中文
On common neighborhood graphs II 关于共邻域图2
IF 1.3
Iranian journal of mathematical chemistry Pub Date : 2018-03-01 DOI: 10.22052/IJMC.2017.53463.1195
A. Hamzeh, A. Iranmanesh, S. Hossein-Zadeh, M. Hosseinzadeh, I. Gutman
{"title":"On common neighborhood graphs II","authors":"A. Hamzeh, A. Iranmanesh, S. Hossein-Zadeh, M. Hosseinzadeh, I. Gutman","doi":"10.22052/IJMC.2017.53463.1195","DOIUrl":"https://doi.org/10.22052/IJMC.2017.53463.1195","url":null,"abstract":"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.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"6 1","pages":"37-46"},"PeriodicalIF":1.3,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75263333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
General Theory of Cycle-Dependence of Total pi-Electron Energy 总电子能量循环依赖的一般理论
IF 1.3
Iranian journal of mathematical chemistry Pub Date : 2018-03-01 DOI: 10.22052/IJMC.2017.83263.1285
I. Gutman
{"title":"General Theory of Cycle-Dependence of Total pi-Electron Energy","authors":"I. Gutman","doi":"10.22052/IJMC.2017.83263.1285","DOIUrl":"https://doi.org/10.22052/IJMC.2017.83263.1285","url":null,"abstract":"The theoretical treatment of cycle-effects on total pi-electron energy, mainly elaborated by Nenad Trinajstic and his research group, is re-stated 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.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"106 1","pages":"9-16"},"PeriodicalIF":1.3,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78089914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
More inequalities for Laplacian indices by way of majorization 用多数化方法得到拉普拉斯指数的更多不等式
IF 1.3
Iranian journal of mathematical chemistry Pub Date : 2018-03-01 DOI: 10.22052/IJMC.2017.100951.1317
J. Palacios
{"title":"More inequalities for Laplacian indices by way of majorization","authors":"J. Palacios","doi":"10.22052/IJMC.2017.100951.1317","DOIUrl":"https://doi.org/10.22052/IJMC.2017.100951.1317","url":null,"abstract":"The n-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 dG = 2|E|/n. We also find some particular tight bounds for some classes of graphs in terms of customary graph parameters.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"4 1","pages":"17-24"},"PeriodicalIF":1.3,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91004352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Note on Revised Szeged Index of Graph Operations 关于图运算的修正Szeged索引的注解
IF 1.3
Iranian journal of mathematical chemistry Pub Date : 2018-03-01 DOI: 10.22052/IJMC.2017.58647.1228
N. Dehgardi
{"title":"A Note on Revised Szeged Index of Graph Operations","authors":"N. Dehgardi","doi":"10.22052/IJMC.2017.58647.1228","DOIUrl":"https://doi.org/10.22052/IJMC.2017.58647.1228","url":null,"abstract":"Let $G$ be a finite and simple graph with edge set $E(G)$‎. ‎The revised Szeged index is defined as‎ ‎$Sz^{*}(G)=sum_{e=uvin E(G)}(n_u(e|G)+frac{n_{G}(e)}{2})(n_v(e|G)+frac{n_{G}(e)}{2}),$‎ ‎where $n_u(e|G)$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$ and‎ ‎$n_{G}(e)$ is the number of‎ ‎equidistant vertices of $e$ in $G$‎. ‎In this paper‎, ‎we compute the revised Szeged index of the‎ ‎join and corona product of graphs‎.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"563 1","pages":"57-63"},"PeriodicalIF":1.3,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72598104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Weak Chemical Hyperstructures Associated to Electrochemical Cells 与电化学电池相关的弱化学超结构
IF 1.3
Iranian journal of mathematical chemistry Pub Date : 2018-03-01 DOI: 10.22052/IJMC.2017.88790.1294
M. A. Tahan, B. Davvaz
{"title":"Weak Chemical Hyperstructures Associated to Electrochemical Cells","authors":"M. A. Tahan, B. Davvaz","doi":"10.22052/IJMC.2017.88790.1294","DOIUrl":"https://doi.org/10.22052/IJMC.2017.88790.1294","url":null,"abstract":"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.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"25 1","pages":"65-75"},"PeriodicalIF":1.3,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72531791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
The uniqueness theorem for inverse nodal problems with a chemical potential 具有化学势的逆节点问题的唯一性定理
IF 1.3
Iranian journal of mathematical chemistry Pub Date : 2017-12-01 DOI: 10.22052/IJMC.2016.39228
S. Mosazadeh
{"title":"The uniqueness theorem for inverse nodal problems with a chemical potential","authors":"S. Mosazadeh","doi":"10.22052/IJMC.2016.39228","DOIUrl":"https://doi.org/10.22052/IJMC.2016.39228","url":null,"abstract":"In this paper, an inverse nodal problem for a second-order differential equation having a chemical potential on a finite interval is investigated. First, we estimate the nodal points and nodal lengths of differential operator. Then, we show that the potential can be uniquely determined by a dense set of nodes of the eigenfunctions.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"10 1","pages":"403-411"},"PeriodicalIF":1.3,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85951861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Extremal Trees with Respect to Some Versions of Zagreb Indices Via Majorization 关于一些版本的Zagreb指数的极值树
IF 1.3
Iranian journal of mathematical chemistry Pub Date : 2017-12-01 DOI: 10.22052/IJMC.2017.46693.1161
M. Eliasi, A. Ghalavand
{"title":"Extremal Trees with Respect to Some Versions of Zagreb Indices Via Majorization","authors":"M. Eliasi, A. Ghalavand","doi":"10.22052/IJMC.2017.46693.1161","DOIUrl":"https://doi.org/10.22052/IJMC.2017.46693.1161","url":null,"abstract":"The aim of this paper is using the majorization technique to identify the classes of trees with extermal (minimal or maximal) value of some topological indices, among all trees of order n ≥ 12.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"483 1","pages":"391-401"},"PeriodicalIF":1.3,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77795632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Numerical modeling for nonlinear biochemical reaction networks 非线性生化反应网络的数值模拟
IF 1.3
Iranian journal of mathematical chemistry Pub Date : 2017-12-01 DOI: 10.22052/IJMC.2017.47506.1170
Z. Zafar, Kashif Rehan, M. Mushtaq, M. Rafiq
{"title":"Numerical modeling for nonlinear biochemical reaction networks","authors":"Z. Zafar, Kashif Rehan, M. Mushtaq, M. Rafiq","doi":"10.22052/IJMC.2017.47506.1170","DOIUrl":"https://doi.org/10.22052/IJMC.2017.47506.1170","url":null,"abstract":"Nowadays, numerical models have great importance in every field of science, especially for solving the nonlinear differential equations, partial differential equations, biochemical reactions, etc. The total time evolution of the reactant concentrations in the basic enzyme-substrate reaction is simulated by the Runge-Kutta of order four (RK4) and by nonstandard finite difference (NSFD) method. A NSFD model has been constructed for the biochemical reaction problem and numerical experiments are performed for different values of discretization parameter ‘h’. The results are compared with the well-known numerical scheme, i.e. RK4. Unlike RK4 which fails for large time steps, the developed scheme gives results that converge to true steady states for any time step used.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"3107 1","pages":"413-423"},"PeriodicalIF":1.3,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86555520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Anti-forcing number of some specific graphs 某些特定图的反强迫数
IF 1.3
Iranian journal of mathematical chemistry Pub Date : 2017-09-01 DOI: 10.22052/IJMC.2017.60978.1235
S. Alikhani, N. Soltani
{"title":"Anti-forcing number of some specific graphs","authors":"S. Alikhani, N. Soltani","doi":"10.22052/IJMC.2017.60978.1235","DOIUrl":"https://doi.org/10.22052/IJMC.2017.60978.1235","url":null,"abstract":"Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specific graphs that are of importance in chemistry and study their anti-forcing numbers.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"7 1","pages":"313-325"},"PeriodicalIF":1.3,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78967136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On the Spectra of Reduced Distance Matrix of the Generalized Bethe Trees 广义贝特树的约简距离矩阵谱
IF 1.3
Iranian journal of mathematical chemistry Pub Date : 2017-09-01 DOI: 10.22052/IJMC.2017.30051.1116
A. Heydari
{"title":"On the Spectra of Reduced Distance Matrix of the Generalized Bethe Trees","authors":"A. Heydari","doi":"10.22052/IJMC.2017.30051.1116","DOIUrl":"https://doi.org/10.22052/IJMC.2017.30051.1116","url":null,"abstract":"Let G be a simple connected graph and {v_1,v_2,..., v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G. In this paper, we compute the spectrum of the reduced distance matrix of the generalized Bethe trees.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"55 1","pages":"291-298"},"PeriodicalIF":1.3,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74177258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信