eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2014-12-01
5
Supplement 1
1
6
10.22052/ijmc.2014.5541
5541
The First Geometric–Arithmetic Index of Some Nanostar Dendrimers
A. Madanshekaf
amadanshekaf@semnan.ac.ir
1
M. Moradi
2
Semnan University
Semnan University
Dendrimers are highly branched organic macromolecules with successive layers or generations of branch units surrounding a central core [1,4]. These are key molecules in nanotechnology and can be put to good use. In this article, we compute the first geometricarithmetic index of two infinite classes of dendrimers.
http://ijmc.kashanu.ac.ir/article_5541_b9ad2e135053d1febb7d27424326357c.pdf
Nanostar dendrimer
The first geometric-arithmetic index
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2014-12-01
5
Supplement 1
7
15
10.22052/ijmc.2014.6858
6858
The Laplacian Polynomial and Kirchhoff Index of the k-th Semi Total Point Graphs
Z. Mehranian
mehranian.z@gmail.com
1
Department of Mathematics, University of Qom, Qom, Iran
The k-th semi total point graph of a graph G, , is a graph obtained from G by adding k vertices corresponding to each edge and connecting them to the endpoints of edge considered. In this paper, a formula for Laplacian polynomial of in terms of characteristic and Laplacian polynomials of G is computed, where is a connected regular graph.The Kirchhoff index of is also computed.
http://ijmc.kashanu.ac.ir/article_6858_49f40547a27c813e453cdcfff61b24ed.pdf
Resistance distance
Kirchhoff index
Laplacian specturam
Derived graph
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2014-12-01
5
Supplement 1
17
20
10.22052/ijmc.2014.7591
7591
Flow Polynomial of some Dendrimers
H. Sharifi
sharifi_h@iust.ac.ir
1
G. H. Fath-Tabar
gh.fathtabar@gmail.com
2
Islamic Azad University
University of Kashan
Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a ﬂow. Tutte was introduced the ﬂow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer coefficients by F(G,λ) In this paper the Flow polynomial of some dendrimers are computed.
http://ijmc.kashanu.ac.ir/article_7591_08263a76931061fd7e4ced581cb66dad.pdf
Flow polynomial
Dendrimer
graph
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2014-12-01
5
Supplement 1
21
25
10.22052/ijmc.2014.7618
7618
The Neighbourhood Polynomial of some Nanostructures
S. Alikhani
alikhani206@gmail.com
1
E. Mahmoudi
emahmoudi@yazd.ac.ir
2
Yazd University
Yazd University
The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some nanostructures.
http://ijmc.kashanu.ac.ir/article_7618_915a872c50324158cd249be6c4db13ad.pdf
Neighbourhood Polynomial
Dendrimer nanostar
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2014-12-01
5
Supplement 1
27
33
10.22052/ijmc.2014.7772
7772
Perfect Matchings in Edge-Transitive Graphs
A. Marandi
1
A. Nejah
2
A. Behmaram
behmarammath@gmail.com
3
University of Tehran
University of Tehran
University of Tabriz
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an end vertex in {u,v}.
http://ijmc.kashanu.ac.ir/article_7772_6c1386b641e42586265ac97c82fcede7.pdf
Perfect Matching
Edge-transitive graph
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2014-12-01
5
Supplement 1
35
44
10.22052/ijmc.2014.7773
7773
The Center and Periphery of Composite Graphs
Z. Yarahmadi
z.yarahmadi@gmail.com
1
S. Moradi
sirousmoradi@gmail.com
2
Islamic Azad University
Arak Unversity
The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between eccentricity, radius and diameter of such composite graphs are also investigated. As an application we determine the center and periphery of some chemical graphs such as nanotorus and nanotubes covered by C4.
http://ijmc.kashanu.ac.ir/article_7773_e1bcc982b7f0fa5c7778485da3528061.pdf
Eccentricity
radius
diameter
Center
Periphery
eng
University of Kashan
Iranian Journal of Mathematical Chemistry
2228-6489
2008-9015
2014-12-01
5
Supplement 1
45
51
10.22052/ijmc.2014.7776
7776
Relation Between Wiener, Szeged and Detour Indices
N. Azimi
ghorbani30@gmail.com
1
M. Roumena
modjtaba.ghorbani@gmail.com
2
M. Ghorbani
mghorbani@srttu.edu
3
Srtt Univ.
Srtt Univ.
Department of mathematics, Shahid Rajaee Teacher Training University
In theoretical chemistry, molecular structure descriptors are used to compute properties of chemical compounds. Among them Wiener, Szeged and detour indices play significant roles in anticipating chemical phenomena. In the present paper, we study these topological indices with respect to their difference number.
http://ijmc.kashanu.ac.ir/article_7776_399fb4dba96bdfcaab0aa600fba7f2f6.pdf
Wiener index
Szeged index
Detour index