eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2017-09-01
8
3
231
257
10.22052/ijmc.2017.64354.1248
45087
Autobiographical notes
N. Trinajstić
trina@irb.hr
1
The Rugjer Bošković Institute and Croatian Academy of Sciences and Arts, Zagreb, Croatia
I was born in Zagreb (Croatia) on October 26, 1936. My parents were Regina (née Pavić) (April17, 1916, Zagreb–March 9, 1992, Zagreb) and Cvjetko Trinajstić (September 9, 1913, Volosko–October 29, 1998, Richmond, Australia).
http://ijmc.kashanu.ac.ir/article_45087_fe31c60ddad05b1f35c8ccaeb75be409.pdf
Chemical graph theory
mathematical chemistry
Nanad Trinajstic
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2017-09-01
8
3
259
273
10.22052/ijmc.2017.43258
43258
Graphs with smallest forgotten index
I. Gutman
gutman@kg.ac.rs
1
A. Ghalavand
ali797ghalavand@gmail.com
2
T. Dehghan-Zadeh
ta.dehghanzadeh@gmail.com
3
A. Ashrafi
ijmc@kashanu.ac.ir
4
University of Kragujevac, Serbia
University of Kashan
University of Kashan
University of Kashan
The forgotten topological index of a molecular graph $G$ is<br /> defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes<br /> the degree of vertex $u$ in $G$. The first through the sixth smallest<br /> forgotten indices among all trees, the first through<br /> the third smallest forgotten indices among all connected<br /> graph with cyclomatic number $gamma=1,2$, the first through<br /> the fourth for $gamma=3$, and the first and the second for<br /> $gamma=4,5$ are determined. These results are compared<br /> with those obtained for the first Zagreb index.
http://ijmc.kashanu.ac.ir/article_43258_60932aad8f9b423afed9a875153fe9a1.pdf
Forgotten topological index
Unicyclic graphs
Bicyclic graphs
Tricyclic graphs
Tetracyclic graphs
Pentacyclic graphs
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2017-09-01
8
3
275
283
10.22052/ijmc.2017.71544.1262
45113
On the first variable Zagreb index
K. Moradian
rst.kazemi@gmail.com
1
R. Kazemi
r.kazemi@sci.ikiu.ac.ir
2
M. Behzadi
behzadi.mh@gmail.com
3
Department of Statistics, Islamic Azad University
Imam Khomeini international university
Department of Statistics, Islamic Azad University
The first variable Zagreb index of graph $G$ is defined as<br /> begin{eqnarray*}<br /> M_{1,lambda}(G)=sum_{vin V(G)}d(v)^{2lambda},<br /> end{eqnarray*}<br /> where $lambda$ is a real number and $d(v)$ is the degree of<br /> vertex $v$.<br /> In this paper, some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (recursive trees,<br /> plane-oriented recursive trees and binary increasing trees) are<br /> given.
http://ijmc.kashanu.ac.ir/article_45113_752ad28b4b442dc6a1f6961c8509c82a.pdf
First variable Zagreb index
Random increasing trees
Distribution function
Expected value
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2017-09-01
8
3
285
290
10.22052/ijmc.2017.64656.1249
48532
Computing the additive degree-Kirchhoff index with the Laplacian matrix
J. Palacios
jpalacios@unm.edu
1
The University of New Mexico, Albuquerque, NM 87131, USA
For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree-Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the additive degree-Kirchhoff index and give a compact Matlab program that computes all three Kirchhoffian indices with the Laplacian matrix as the only input.
http://ijmc.kashanu.ac.ir/article_48532_4ea24f618de4aee3f2e5feaf2ad0c8ca.pdf
Degree-Kirchhoff index
Laplacian matrix
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2017-09-01
8
3
291
298
10.22052/ijmc.2017.30051.1116
48533
On the spectra of reduced distance matrix of the generalized Bethe trees
A. Heydari
a-heidari@iau-arak.ac.ir
1
Arak University of Technology
Let G be a simple connected graph and {v_1,v_2,..., v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G. In this paper, we compute the spectrum of the reduced distance matrix of the generalized Bethe trees.
http://ijmc.kashanu.ac.ir/article_48533_625a9813ec4456891441f9eb3d1369f5.pdf
Reduced distance matrix
Generalized Bethe Tree
spectrum
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2017-09-01
8
3
299
311
10.22052/ijmc.2017.83138.1284
49784
On the second order first zagreb index
B Basavanagoud
b.basavanagoud@gmail.com
1
S. Patil
shreekantpatil949@gmail.com
2
H. Y. Deng
hydeng@hunnu.edu.cn
3
KARNATAK UNIVERSITY DHARWAD
Karnatak University
Key Laboratoryof High Performance Computing and Stochastic Information Processing, College of Mathematics and Computer Science, Hunan Normal University, Changsha, Hunan, 410081, P. R. China
Inspired by the chemical applications of higher-order connectivity index (or<br /> Randic index), we consider here the higher-order first Zagreb index of a molecular graph.<br /> In this paper, we study the linear regression analysis of the second order first Zagreb<br /> index with the entropy and acentric factor of an octane isomers. The linear model, based<br /> on the second order first Zagreb index, is better than models corresponding to the first<br /> Zagreb index and F-index. Further, we compute the second order first Zagreb index of<br /> line graphs of subdivision graphs of 2D-lattice, nanotube and nanotorus of TUC4C8[p; q],<br /> tadpole graphs, wheel graphs and ladder graphs.
http://ijmc.kashanu.ac.ir/article_49784_8354f7dae388f810624e8396d0fc4b3a.pdf
topological index
line graph
subdivision graph
Nanostructure
tadpole graph
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2017-09-01
8
3
313
325
10.22052/ijmc.2017.60978.1235
49785
Anti-forcing number of some specific graphs
S. Alikhani
alikhani@yazd.ac.ir
1
N. Soltani
neda_soltani@ymail.com
2
Yazd University, Yazd, Iran
Yazd University
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specific graphs that are of importance in chemistry and study <br /> their anti-forcing numbers.
http://ijmc.kashanu.ac.ir/article_49785_5762b32f4d73311e1b30d195fe19f9ba.pdf
Anti-forcing number
Anti-forcing set
Corona product
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2017-09-01
8
3
327
338
10.22052/ijmc.2017.43481
43481
On the forgotten topological index
A. Khaksari
khm.paper@gmail.com
1
M. Ghorbani
mghorbani@sru.ac.ir
2
Department of Mathematics, Payame Noor University, Tehran, 19395 – 3697, I. R. Iran
Department of mathematics, Shahid Rajaee Teacher Training University
The forgotten topological index is defined as sum of third power of degrees. In this paper, we compute some properties of forgotten index and then we determine it for some classes of product graphs.
http://ijmc.kashanu.ac.ir/article_43481_e5cf8939aefd37aece3fc2f3f7bd8375.pdf
Zagreb indices
forgotten index
Graph products