@article {
author = {Zuo, Y. and Tang, Y. and Deng, H. Y.},
title = {The Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {9},
number = {4},
pages = {241-254},
year = {2018},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2018.143823.1381},
abstract = {As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=\frac{m}{\mu+1}\sum\limits_{uv\in E} \frac{1}{\sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=\frac{m}{\mu+1}\sum\limits_{uv\in E} \frac{1}{\sqrt{D_{G}(u)+D_{G}(v)}}$, respectively, where $D_{G}(u)=\sum\limits_{v\in V}d(u,v)$ is the distance sum of vertex $u$ in $G$, $m$ is the number of edges and $\mu$ is the cyclomatic number of $G$. They are useful distance-based descriptor in chemometrics. In this paper, we focus on the extremal graphs of spiro and polyphenyl hexagonal chains with respect to the Balaban index and the sum-Balaban index.},
keywords = {Balaban index,sum-Balaban index,spiro hexagonal chain, polyphenyl hexagonal chain},
url = {http://ijmc.kashanu.ac.ir/article_73763.html},
eprint = {http://ijmc.kashanu.ac.ir/article_73763_77c3dbe43fd89410f6e92ef2ba7b252a.pdf}
}
@article {
author = {Rezaei, A. and Reisi-Vanani, A. and Masoum, S.},
title = {An application of geometrical isometries in non-planar molecules},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {9},
number = {4},
pages = {255-261},
year = {2018},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2017.51462.1186},
abstract = {In this paper we introduce a novel methodology to transmit the origin to the center of a polygon in a molecule structure such that the special axis be perpendicular to the plane containing the polygon. The mathematical calculation are described completely and the algorithm will be showed as a computer program.},
keywords = {frame,isometry,orthogonal transformation,polygon,Non-planar polycyclic molecule},
url = {http://ijmc.kashanu.ac.ir/article_45090.html},
eprint = {http://ijmc.kashanu.ac.ir/article_45090_b0e5726e71cd6e6f99f64bd79fa9d5a6.pdf}
}
@article {
author = {Sahin, B. and Ediz, S.},
title = {On ev-degree and ve-degree topological indices},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {9},
number = {4},
pages = {263-277},
year = {2018},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2017.72666.1265},
abstract = {Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the evdegree and ve-degree Zagreb and Randić indices have been defined very recently as parallel of the classical definitions of Zagreb and Randić indices. It was shown that ev-degree and ve-degree topological indices can be used as possible tools in QSPR researches . In this paper we define the ve-degree and ev-degree Narumi–Katayama indices, investigate the predicting power of these novel indices and extremal graphs with respect to these novel topological indices. Also we give some basic mathematical properties of ev-degree and ve-degree NarumiKatayama and Zagreb indices.},
keywords = {ev-degree,ve-degree,ev-degree topological indices,ve-degree topological indices},
url = {http://ijmc.kashanu.ac.ir/article_81353.html},
eprint = {http://ijmc.kashanu.ac.ir/article_81353_b1c7d097f932eb1537ce6797d7e1ed84.pdf}
}
@article {
author = {Dehgardi, N. and Aram, H. and Khodkar, A.},
title = {The second geometric-arithmetic index for trees and unicyclic graphs},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {9},
number = {4},
pages = {279-287},
year = {2018},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2017.81079.1277},
abstract = {Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=\sum_{uv\in E(G)}\frac{2\sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree of the tree. We also find a sharp upper bound for $GA_2(G)$, where $G$ is a unicyclic graph, in terms of the order, maximum degree and girth of $G$. In addition, we characterize the trees and unicyclic graphs which achieve the upper bounds.},
keywords = {Second geometric-arithmetic index,Trees,Unicyclic graphs},
url = {http://ijmc.kashanu.ac.ir/article_81544.html},
eprint = {http://ijmc.kashanu.ac.ir/article_81544_d6ee54879d3b9af783c9e4a0e8b112b9.pdf}
}
@article {
author = {Alikhani, S. and Soltani, N.},
title = {On the saturation number of graphs},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {9},
number = {4},
pages = {289-299},
year = {2018},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2018.113339.1337},
abstract = {Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation number of the corona product of two specific graphs. We also consider some graphs with certain constructions that are of importance in chemistry and study their saturation number.},
keywords = {Maximal matching,Saturation number,corona},
url = {http://ijmc.kashanu.ac.ir/article_81558.html},
eprint = {http://ijmc.kashanu.ac.ir/article_81558_806cdc8af74e642c5afec1d82f3f77db.pdf}
}