2018-03-19T23:56:36Z
http://ijmc.kashanu.ac.ir/?_action=export&rf=summon&issue=6000
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2018
9
1
Hypercube Related Polytopes
M.
Diudea
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
2018
03
01
1
8
http://ijmc.kashanu.ac.ir/article_54283_c8f8c9ffcbc23f8dfa542dbfc2a3a8d4.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2018
9
1
General Theory of Cycle-Dependence of Total pi-Electron Energy
I.
Gutman
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.
Total pi-electron energy
topological resonance energy
energy-effect of cycle
aromaticity
Sachs theorem
2018
03
01
9
16
http://ijmc.kashanu.ac.ir/article_54503_13f8767d02456a19a5b7a8c6affb8c32.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2018
9
1
More inequalities for Laplacian indices by way of majorization
J.
Palacios
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
2018
03
01
17
24
http://ijmc.kashanu.ac.ir/article_54880_d880ee06482840ddf89dd87e9a57f1b2.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2018
9
1
Fractal-Like Kinetics Study of Adsorption on Multi-walled Carbon Nanotube
H.
Bashiri
A.
Sahjari
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
2018
03
01
25
35
http://ijmc.kashanu.ac.ir/article_54881_f0448acb456b2617e794659a8e401a55.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2018
9
1
On common neighborhood graphs II
A.
Hamzeh
A.
Iranmanesh
S.
Hossein-Zadeh
M.
Hosseinzadeh
I.
Gutman
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.
Common neighborhood graph
congraph
Mycielski graph
shadow graph
Haj´os join
2018
03
01
37
46
http://ijmc.kashanu.ac.ir/article_55313_8c66633a3d6bc9e712ed2dae39f03636.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2018
9
1
On the Eccentric Connectivity Index of Unicyclic Graphs
Y.
Nacaroğlu
A.
Maden
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.
unicyclic graph
eccentric connectivity index
matching numbers
perfect matching
2018
03
01
47
56
http://ijmc.kashanu.ac.ir/article_55332_90df2cb067f37b466f182b9336756750.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2018
9
1
A Note on Revised Szeged Index of Graph Operations
N.
Dehgardi
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.
index of graphs
revised Szeged index
graph operations
2018
03
01
57
63
http://ijmc.kashanu.ac.ir/article_55333_c6c9bd64629c680d2b0b41431ef49496.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2018
9
1
Weak chemical hyperstructures associated to electrochemical cells
B.
Davvaz
M.
Al Tahan
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
2018
03
01
65
75
http://ijmc.kashanu.ac.ir/article_55795_08e59993d03ec6a0c0b968c95364f2a3.pdf