2018
9
1
0
100
Hypercube Related Polytopes
2
2
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.
1

1
8


M.
Diudea
BabesBolyai University, Cluj, Romania
BabesBolyai University, Cluj, Romania
Romania
diudea@gmail.com
polyhedron
npolytope
24cell
propellane
General Theory of CycleDependence of Total piElectron Energy
2
2
The theoretical treatment of cycleeffects on total pielectron energy, mainly elaborated by Nenad Trinajstic and his research group, is restated in a general and more formal manner. It enables to envisage several other possible ways of measuring the cycleeffects and points at further directions of research.
1

9
16


I.
Gutman
Faculty of Science, University of Kragujevac, Kragujevac, Serbia
Faculty of Science, University of Kragujevac,
Serbia
gutman@kg.ac.rs
Total pielectron energy
topological resonance energy
energyeffect of cycle
aromaticity
Sachs theorem
More inequalities for Laplacian indices by way of majorization
2
2
The ntuple 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 = 2E/n. We also find some particular tight bounds for some classes of graphs in terms of customary graph parameters.
1

17
24


J.
Palacios
The University of New Mexico, Albuquerque, NM 87131, USA
The University of New Mexico, Albuquerque,
USA
jpalacios@unm.edu
Laplacian indices
conjugate sequence
majorization
FractalLike Kinetics Study of Adsorption on Multiwalled Carbon Nanotube
2
2
The fractal degree of adsorption on the multiwalled carbon nanotube has been investigated. The fractallike Langmuir kinetics model has been used to obtain the fractal degree of ion adsorption on multiwalled carbon nanotube. The behavior of the fractallike kinetics equation was compared with some famous rate equations like Langmuir, pseudofirstorder and pseudosecondorder equations. It is shown that the kinetic of adsorption onto multiwalled carbon nanotube can be used to obtain its spectral dimension, successfully.
1

25
35


H.
Bashiri
University of Kashan
University of Kashan
I R Iran
hbashiri@kashanu.ac.ir


A.
Sahjari
University of Kashan
University of Kashan
I R Iran
shajariadele@yahoo.com
Multiwalled carbon nanotube
Spectral dimension
Fractallike Langmuir model
Kinetics equation
Adsorption
On common neighborhood graphs II
2
2
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.
1

37
46


A.
Hamzeh
Tarbiat Modares University
Tarbiat Modares University
I R Iran
hamze2006@yahoo.com


A.
Iranmanesh
Tarbiat Modares University
Tarbiat Modares University
I R Iran
iranmanesh@modares.ac.ir


S.
HosseinZadeh
Tarbiat Modares University
Tarbiat Modares University
I R Iran
hosseinzadeh.samaneh@yahoo.com


M.
Hosseinzadeh
Tarbiat Modares University
Tarbiat Modares University
I R Iran
ma.hoseinzade@gmail.com


I.
Gutman
University of Kragujevac
University of Kragujevac
Serbia
gutman@kg.ac.rs
Common neighborhood graph
congraph
Mycielski graph
shadow graph
Haj´os join
On the Eccentric Connectivity Index of Unicyclic Graphs
2
2
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.
1

47
56


Y.
Nacaroğlu
Department of Mathematics, Faculty of Science, Selcuk University
Department of Mathematics, Faculty of Science,
Turkey
yasarnacar@hotmail.com


A.
Maden
Department of Mathematics, Faculty of Science, Selcuk University
Department of Mathematics, Faculty of Science,
Turkey
aysedilekmaden@selcuk.edu.tr
unicyclic graph
eccentric connectivity index
matching numbers
perfect matching
A Note on Revised Szeged Index of Graph Operations
2
2
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(eG)+frac{n_{G}(e)}{2})(n_v(eG)+frac{n_{G}(e)}{2}),$ where $n_u(eG)$ 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.
1

57
63


N.
Dehgardi
Sirjan University of Technology
Sirjan University of Technology
I R Iran
n.dehgardi@sirjantech.ac.ir
index of graphs
revised Szeged index
graph operations