University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
9
1
2018
03
01
Hypercube Related Polytopes
1
8
EN
M.
V.
Diudea
Babes-Bolyai University, Cluj, Romania
diudea@gmail.com
10.22052/ijmc.2017.101019.1318
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.
polyhedron,n-polytope,24-cell,propellane
http://ijmc.kashanu.ac.ir/article_54283.html
http://ijmc.kashanu.ac.ir/article_54283_c8f8c9ffcbc23f8dfa542dbfc2a3a8d4.pdf
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
9
1
2018
03
01
General Theory of Cycle-Dependence of Total pi-Electron Energy
9
16
EN
I.
Gutman
Faculty of Science, University of Kragujevac, Kragujevac, Serbia
gutman@kg.ac.rs
10.22052/ijmc.2017.83263.1285
The theoretical treatment of cycle-effects on total pi-electron energy,<br /><br /> mainly elaborated by Nenad Trinajstic and his research group, is<br /><br /> re-stated in a general and more formal manner. It enables to envisage several<br /><br /> other possible ways of measuring the cycle-effects and points at further<br /><br /> directions of research.
Total pi-electron energy,topological resonance energy,energy-effect of cycle,aromaticity,Sachs theorem
http://ijmc.kashanu.ac.ir/article_54503.html
http://ijmc.kashanu.ac.ir/article_54503_13f8767d02456a19a5b7a8c6affb8c32.pdf
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
9
1
2018
03
01
More inequalities for Laplacian indices by way of majorization
17
24
EN
J.
Palacios
The University of New Mexico, Albuquerque, NM 87131, USA
jpalacios@unm.edu
10.22052/ijmc.2017.100951.1317
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.
Laplacian indices,conjugate sequence,majorization
http://ijmc.kashanu.ac.ir/article_54880.html
http://ijmc.kashanu.ac.ir/article_54880_d880ee06482840ddf89dd87e9a57f1b2.pdf
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
9
1
2018
03
01
Fractal-Like Kinetics Study of Adsorption on Multi-walled Carbon Nanotube
25
35
EN
H.
Bashiri
University of Kashan
hbashiri@kashanu.ac.ir
A.
Sahjari
University of Kashan
shajariadele@yahoo.com
10.22052/ijmc.2017.48936.1175
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.
Multi-walled carbon nanotube,Spectral dimension,Fractal-like Langmuir model,Kinetics equation,Adsorption
http://ijmc.kashanu.ac.ir/article_54881.html
http://ijmc.kashanu.ac.ir/article_54881_f0448acb456b2617e794659a8e401a55.pdf
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
9
1
2018
03
01
On common neighborhood graphs II
37
46
EN
A.
Hamzeh
Tarbiat Modares University
hamze2006@yahoo.com
A.
Iranmanesh
Tarbiat Modares University
iranmanesh@modares.ac.ir
S.
Hossein-Zadeh
Tarbiat Modares University
hosseinzadeh.samaneh@yahoo.com
M.
A.
Hosseinzadeh
Tarbiat Modares University
ma.hoseinzade@gmail.com
I.
Gutman
University of Kragujevac
gutman@kg.ac.rs
10.22052/ijmc.2017.53463.1195
Let G be a simple graph with vertex set V (G). The common neighborhood graph or<br /> congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices<br /> are adjacent if and only if they have at least one common neighbor in G. We compute the<br /> congraphs of some composite graphs. Using these results, the congraphs of several special<br /> graphs are determined.
Common neighborhood graph,congraph,Mycielski graph,shadow graph,Haj´os join
http://ijmc.kashanu.ac.ir/article_55313.html
http://ijmc.kashanu.ac.ir/article_55313_8c66633a3d6bc9e712ed2dae39f03636.pdf
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
9
1
2018
03
01
On the Eccentric Connectivity Index of Unicyclic Graphs
47
56
EN
Y.
Nacaroğlu
Department of Mathematics, Faculty of Science, Selcuk University
yasarnacar@hotmail.com
A.
D.
Maden
Department of Mathematics, Faculty of Science, Selcuk University
aysedilekmaden@selcuk.edu.tr
10.22052/ijmc.2017.59425.1231
In this paper, we obtain the upper and lower bounds on the eccen-<br /> tricity connectivity index of unicyclic graphs with perfect matchings. Also we<br /> give some lower bounds on the eccentric connectivity index of unicyclic graphs<br /> with given matching numbers.
unicyclic graph,eccentric connectivity index,matching numbers,perfect matching
http://ijmc.kashanu.ac.ir/article_55332.html
http://ijmc.kashanu.ac.ir/article_55332_90df2cb067f37b466f182b9336756750.pdf
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
9
1
2018
03
01
A Note on Revised Szeged Index of Graph Operations
57
63
EN
N.
Dehgardi
Sirjan University of Technology
n.dehgardi@sirjantech.ac.ir
10.22052/ijmc.2017.58647.1228
Let $G$ be a finite and simple graph with edge set $E(G)$. The revised Szeged index is defined as<br /> $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}),$<br /> where $n_u(e|G)$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$ and <br /> $n_{G}(e)$ is the number of<br /> equidistant vertices of $e$ in $G$. <br /> In this paper, we compute the revised Szeged index of the<br /> join and corona product of graphs.
index of graphs,revised Szeged index,graph operations
http://ijmc.kashanu.ac.ir/article_55333.html
http://ijmc.kashanu.ac.ir/article_55333_c6c9bd64629c680d2b0b41431ef49496.pdf
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
9
1
2018
03
01
Weak chemical hyperstructures associated to electrochemical cells
65
75
EN
B.
Davvaz
Yazd University
davvaz@yazd.ac.ir
M.
Al Tahan
Lebanese International University
madeline.tahan@liu.edu.lb
10.22052/ijmc.2017.88790.1294
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.
Hv-semigroup,complete part,fundamental relation,Galvanic cell,Electrolytic cell
http://ijmc.kashanu.ac.ir/article_55795.html
http://ijmc.kashanu.ac.ir/article_55795_08e59993d03ec6a0c0b968c95364f2a3.pdf