eng
Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
2538-2314
2017-12-01
7
2
71
77
10.22061/jmns.2017.513
513
On borderenergetic and L-borderenergetic graphs
Mardjan Hakimi-Nezhaad
m.hakimi20@gmail.com
1
Department of Mathematics, Shahid Rajaee Teacher Training University
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.
http://jmathnano.sru.ac.ir/article_513_e93b254f3bb974fd3d9d566269730f04.pdf
energy (of graph)
adjacency matrix
Laplacian matrix
signless Laplacian matrix
eng
Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
2538-2314
2017-12-01
7
2
79
83
10.22061/jmns.2017.512
512
On the modified Wiener number
Maryam Jalali Rad
1
Department of Mathematics, University of Kashan
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_4cb22d3564fa9bcb9250b4c8dacf41ac.pdf
eng
Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
2538-2314
2017-12-01
7
2
85
95
707
Sanskruti index of bridge graph and some nanocones
K Pattabiraman
pramank@gmail.com
1
Department of Mathematics, Annamalai University, Annamalainagar 608 002, India
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.
http://jmathnano.sru.ac.ir/article_707_cd8b6a11d8861630dce00cce8e14f068.pdf
Sanskruti index
bridge graph
carbon nanocones
eng
Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
2538-2314
2017-12-01
7
2
97
101
10.22061/jmns.2017.741
741
The Wiener and Szeged indices of hexagonal cored dendrimers
Abbas Heydari
heydari@arakut.ac.ir
1
Arak University
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.
http://jmathnano.sru.ac.ir/article_741_23f9998233252ea7874a727ab592643c.pdf
Wiener index
Szeged index
Dendrimers
nanoparticles
eng
Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
2538-2314
2017-12-01
7
2
103
109
10.22061/jmns.2017.748
748
Study of inverse sum indeg index
Marzieh Hasani
ghorbanitayebeh@gmail.com
1
Departmnet of Mathematics, SRTT University
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_fa5e1b4c717655e7c63778f623e327fc.pdf
eng
Shahid Rajaee Teacher Training University
Journal of Mathematical Nanoscience
2538-2314
2538-2314
2017-12-01
7
2
111
115
10.22061/jmns.2017.749
749
A note on the entropy of graphs
Samaneh Zangi
samanehzangi63@gmail.com
1
Department of Mathematics, Shahid Rajaee Teacher Training University
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.
http://jmathnano.sru.ac.ir/article_749_8a904083c382def25280394c40b316b7.pdf
graph eigenvalues
entropy
regular graph