eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2018-03-01
9
1
1
8
10.22052/ijmc.2017.101019.1318
54283
Hypercube Related Polytopes
M. Diudea
diudea@gmail.com
1
Babes-Bolyai University, Cluj, Romania
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.
http://ijmc.kashanu.ac.ir/article_54283_c8f8c9ffcbc23f8dfa542dbfc2a3a8d4.pdf
polyhedron
n-polytope
24-cell
propellane
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2018-03-01
9
1
9
16
10.22052/ijmc.2017.83263.1285
54503
General Theory of Cycle-Dependence of Total pi-Electron Energy
I. Gutman
gutman@kg.ac.rs
1
Faculty of Science, University of Kragujevac, Kragujevac, Serbia
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.
http://ijmc.kashanu.ac.ir/article_54503_13f8767d02456a19a5b7a8c6affb8c32.pdf
Total pi-electron energy
topological resonance energy
energy-effect of cycle
aromaticity
Sachs theorem
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2018-03-01
9
1
17
24
10.22052/ijmc.2017.100951.1317
54880
More inequalities for Laplacian indices by way of majorization
J. Palacios
jpalacios@unm.edu
1
The University of New Mexico, Albuquerque, NM 87131, USA
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.
http://ijmc.kashanu.ac.ir/article_54880_d880ee06482840ddf89dd87e9a57f1b2.pdf
Laplacian indices
conjugate sequence
majorization
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2018-03-01
9
1
25
35
10.22052/ijmc.2017.48936.1175
54881
Fractal-Like Kinetics Study of Adsorption on Multi-walled Carbon Nanotube
H. Bashiri
hbashiri@kashanu.ac.ir
1
A. Sahjari
shajariadele@yahoo.com
2
University of Kashan
University of Kashan
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.
http://ijmc.kashanu.ac.ir/article_54881_f0448acb456b2617e794659a8e401a55.pdf
Multi-walled carbon nanotube
Spectral dimension
Fractal-like Langmuir model
Kinetics equation
Adsorption
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2018-03-01
9
1
37
46
10.22052/ijmc.2017.53463.1195
55313
On common neighborhood graphs II
A. Hamzeh
hamze2006@yahoo.com
1
A. Iranmanesh
iranmanesh@modares.ac.ir
2
S. Hossein-Zadeh
hosseinzadeh.samaneh@yahoo.com
3
M. Hosseinzadeh
ma.hoseinzade@gmail.com
4
I. Gutman
gutman@kg.ac.rs
5
Tarbiat Modares University
Tarbiat Modares University
Tarbiat Modares University
Tarbiat Modares University
University of Kragujevac
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.
http://ijmc.kashanu.ac.ir/article_55313_8c66633a3d6bc9e712ed2dae39f03636.pdf
Common neighborhood graph
congraph
Mycielski graph
shadow graph
Haj´os join
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2018-03-01
9
1
47
56
10.22052/ijmc.2017.59425.1231
55332
On the Eccentric Connectivity Index of Unicyclic Graphs
Y. Nacaroğlu
yasarnacar@hotmail.com
1
A. Maden
aysedilekmaden@selcuk.edu.tr
2
Department of Mathematics, Faculty of Science, Selcuk University
Department of Mathematics, Faculty of Science, Selcuk University
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.
http://ijmc.kashanu.ac.ir/article_55332_90df2cb067f37b466f182b9336756750.pdf
unicyclic graph
eccentric connectivity index
matching numbers
perfect matching
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2018-03-01
9
1
57
63
10.22052/ijmc.2017.58647.1228
55333
A Note on Revised Szeged Index of Graph Operations
N. Dehgardi
n.dehgardi@sirjantech.ac.ir
1
Sirjan University of Technology
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.
http://ijmc.kashanu.ac.ir/article_55333_c6c9bd64629c680d2b0b41431ef49496.pdf
index of graphs
revised Szeged index
graph operations