@Article{Diudea2018,
author="Diudea, M. V.",
title="Hypercube Related Polytopes",
journal="Iranian Journal of Mathematical Chemistry",
year="2018",
volume="9",
number="1",
pages="1-8",
abstract="Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.",
issn="2228-6489",
doi="10.22052/ijmc.2017.101019.1318",
url="http://ijmc.kashanu.ac.ir/article_54283.html"
}
@Article{Gutman2018,
author="Gutman, I.",
title="General Theory of Cycle-Dependence of Total pi-Electron Energy",
journal="Iranian Journal of Mathematical Chemistry",
year="2018",
volume="9",
number="1",
pages="9-16",
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.",
issn="2228-6489",
doi="10.22052/ijmc.2017.83263.1285",
url="http://ijmc.kashanu.ac.ir/article_54503.html"
}
@Article{Palacios2018,
author="Palacios, J.",
title="More inequalities for Laplacian indices by way of majorization",
journal="Iranian Journal of Mathematical Chemistry",
year="2018",
volume="9",
number="1",
pages="17-24",
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.",
issn="2228-6489",
doi="10.22052/ijmc.2017.100951.1317",
url="http://ijmc.kashanu.ac.ir/article_54880.html"
}
@Article{Bashiri2018,
author="Bashiri, H.
and Sahjari, A.",
title="Fractal-Like Kinetics Study of Adsorption on Multi-walled Carbon Nanotube",
journal="Iranian Journal of Mathematical Chemistry",
year="2018",
volume="9",
number="1",
pages="25-35",
abstract="The fractal degree of adsorption on the multi-walled carbon nanotube has been investigated. The fractal-like Langmuir kinetics model has been used to obtain the fractal degree of ion adsorption on multi-walled carbon nanotube. The behavior of the fractal-like kinetics equation was compared with some famous rate equations like Langmuir, pseudo-first-order and pseudo-second-order equations. It is shown that the kinetic of adsorption onto multi-walled carbon nanotube can be used to obtain its spectral dimension, successfully.",
issn="2228-6489",
doi="10.22052/ijmc.2017.48936.1175",
url="http://ijmc.kashanu.ac.ir/article_54881.html"
}
@Article{Hamzeh2018,
author="Hamzeh, A.
and Iranmanesh, A.
and Hossein-Zadeh, S.
and Hosseinzadeh, M. A.
and Gutman, I.",
title="On common neighborhood graphs II",
journal="Iranian Journal of Mathematical Chemistry",
year="2018",
volume="9",
number="1",
pages="37-46",
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.",
issn="2228-6489",
doi="10.22052/ijmc.2017.53463.1195",
url="http://ijmc.kashanu.ac.ir/article_55313.html"
}
@Article{Nacaroğlu2018,
author="Nacaroğlu, Y.
and Maden, A. D.",
title="On the Eccentric Connectivity Index of Unicyclic Graphs",
journal="Iranian Journal of Mathematical Chemistry",
year="2018",
volume="9",
number="1",
pages="47-56",
abstract="In this paper, we obtain the upper and lower bounds on the eccen- tricity 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.",
issn="2228-6489",
doi="10.22052/ijmc.2017.59425.1231",
url="http://ijmc.kashanu.ac.ir/article_55332.html"
}
@Article{Dehgardi2018,
author="Dehgardi, N.",
title="A Note on Revised Szeged Index of Graph Operations",
journal="Iranian Journal of Mathematical Chemistry",
year="2018",
volume="9",
number="1",
pages="57-63",
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=uv\in 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.",
issn="2228-6489",
doi="10.22052/ijmc.2017.58647.1228",
url="http://ijmc.kashanu.ac.ir/article_55333.html"
}