Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
7
2
2017
12
01
On borderenergetic and L-borderenergetic graphs
71
77
EN
Mardjan
Hakimi-Nezhaad
Department of Mathematics, Shahid Rajaee Teacher Training University
m.hakimi20@gmail.com
10.22061/jmns.2017.513
A graph G of order n is said to be borderenergetic if its energy is equal to 2n − 2. In this paper, we study the borderenergetic and Laplacian borderenergetic graphs.
energy (of graph),adjacency matrix,Laplacian matrix,signless Laplacian matrix
http://jmathnano.sru.ac.ir/article_513.html
http://jmathnano.sru.ac.ir/article_513_e93b254f3bb974fd3d9d566269730f04.pdf
Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
7
2
2017
12
01
On the modified Wiener number
79
83
EN
Maryam
Jalali Rad
Department of Mathematics, University of Kashan
10.22061/jmns.2017.512
The Graovac-Pisanski index is defined in 1991 namely 56 years after the definition of Wiener index by Graovac and Pisanski. They called it as modified Wiener index based on the sum of distances between all the pairs α(u,α(u)) where α stands in the automorphism group of given graph. In this paper, we compute the Graovac-Pisanski index of some classes of graphs.
http://jmathnano.sru.ac.ir/article_512.html
http://jmathnano.sru.ac.ir/article_512_4cb22d3564fa9bcb9250b4c8dacf41ac.pdf
Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
7
2
2017
12
01
Sanskruti index of bridge graph and some nanocones
85
95
EN
K
Pattabiraman
Department of Mathematics, Annamalai University, Annamalainagar 608 002, India
pramank@gmail.com
Sanskruti index is the important topological index used to test the chemical properties of chemical comopounds. In this paper, first we obtain the formulae for calculating the Sanskruti index of bridge graph and carbon nanocones CNCn(k). In addition, Sanskruti index of the Line graph of CNCk[n] nanocones are obtained.
Sanskruti index,bridge graph,carbon nanocones
http://jmathnano.sru.ac.ir/article_707.html
http://jmathnano.sru.ac.ir/article_707_cd8b6a11d8861630dce00cce8e14f068.pdf
Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
7
2
2017
12
01
The Wiener and Szeged indices of hexagonal cored dendrimers
97
101
EN
Abbas
Heydari
Arak University
heydari@arakut.ac.ir
10.22061/jmns.2017.741
A topological index of a molecule graph G is a real number which is invariant under graph isomorphism. The Wiener and Szeged indices are two important distance based topological indices applicable in nanoscience. In this paper, these topological indices is computed for hexagonal cored dendrimers.
Wiener index,Szeged index,Dendrimers,nanoparticles
http://jmathnano.sru.ac.ir/article_741.html
http://jmathnano.sru.ac.ir/article_741_23f9998233252ea7874a727ab592643c.pdf
Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
7
2
2017
12
01
Study of inverse sum indeg index
103
109
EN
Marzieh
Hasani
Departmnet of Mathematics, SRTT University
ghorbanitayebeh@gmail.com
10.22061/jmns.2017.748
Let $MG(i,n)$ $(1leq i leq 3)$ denote to the class of all $n$-vertex molecular graphs with minimum degree $ i$. The inverse sum indeg index of a graph is defined as $ISI=sum_{uvin E(G)} d_ud_v/(d_u+d_v)$, where $ d_{u}$ denotes to the degree of vertex $ u$. In this paper, we propose some extremal molecular graphs with the minimum and the maximum value of inverse sum indeg index in $MG(i,n)$.
http://jmathnano.sru.ac.ir/article_748.html
http://jmathnano.sru.ac.ir/article_748_fa5e1b4c717655e7c63778f623e327fc.pdf
Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
7
2
2017
12
01
A note on the entropy of graphs
111
115
EN
Samaneh
Zangi
Department of Mathematics, Shahid Rajaee Teacher Training University
samanehzangi63@gmail.com
10.22061/jmns.2017.749
A useful tool for investigation various problems in mathematical chemistry and computational physics is graph entropy. In this paper, we introduce a new version of graph entropy and then we determine it for some classes of graphs.
graph eigenvalues,entropy,regular graph
http://jmathnano.sru.ac.ir/article_749.html
http://jmathnano.sru.ac.ir/article_749_8a904083c382def25280394c40b316b7.pdf