ORIGINAL_ARTICLE
The First Geometric–Arithmetic Index of Some Nanostar Dendrimers
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
2014-12-01T11:23:20
2018-05-25T11:23:20
1
6
10.22052/ijmc.2014.5541
Nanostar dendrimer
The first geometric-arithmetic index
A.
Madanshekaf
amadanshekaf@semnan.ac.ir
true
1
Semnan University
Semnan University
Semnan University
LEAD_AUTHOR
M.
Moradi
true
2
Semnan University
Semnan University
Semnan University
AUTHOR
ORIGINAL_ARTICLE
The Laplacian Polynomial and Kirchhoff Index of the k-th Semi Total Point Graphs
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
2014-12-01T11:23:20
2018-05-25T11:23:20
7
15
10.22052/ijmc.2014.6858
Resistance distance
Kirchhoff index
Laplacian specturam
Derived graph
Z.
Mehranian
mehranian.z@gmail.com
true
1
Department of Mathematics, University of Qom, Qom, Iran
Department of Mathematics, University of Qom, Qom, Iran
Department of Mathematics, University of Qom, Qom, Iran
LEAD_AUTHOR
ORIGINAL_ARTICLE
Flow Polynomial of some Dendrimers
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
2014-12-01T11:23:20
2018-05-25T11:23:20
17
20
10.22052/ijmc.2014.7591
Flow polynomial
Dendrimer
graph
H.
Sharifi
sharifi_h@iust.ac.ir
true
1
Islamic Azad University
Islamic Azad University
Islamic Azad University
AUTHOR
G. H.
Fath-Tabar
gh.fathtabar@gmail.com
true
2
University of Kashan
University of Kashan
University of Kashan
LEAD_AUTHOR
ORIGINAL_ARTICLE
The Neighbourhood Polynomial of some Nanostructures
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
2014-12-01T11:23:20
2018-05-25T11:23:20
21
25
10.22052/ijmc.2014.7618
Neighbourhood Polynomial
Dendrimer nanostar
S.
Alikhani
alikhani206@gmail.com
true
1
Yazd University
Yazd University
Yazd University
LEAD_AUTHOR
E.
Mahmoudi
emahmoudi@yazd.ac.ir
true
2
Yazd University
Yazd University
Yazd University
AUTHOR
ORIGINAL_ARTICLE
Perfect Matchings in Edge-Transitive Graphs
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
2014-12-01T11:23:20
2018-05-25T11:23:20
27
33
10.22052/ijmc.2014.7772
perfect matching
Edge-transitive graph
A.
Marandi
true
1
University of Tehran
University of Tehran
University of Tehran
AUTHOR
A.
Nejah
true
2
University of Tehran
University of Tehran
University of Tehran
AUTHOR
A.
Behmaram
behmarammath@gmail.com
true
3
University of Tabriz
University of Tabriz
University of Tabriz
LEAD_AUTHOR
ORIGINAL_ARTICLE
The Center and Periphery of Composite Graphs
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
2014-12-01T11:23:20
2018-05-25T11:23:20
35
44
10.22052/ijmc.2014.7773
Eccentricity
radius
diameter
Center
Periphery
Z.
Yarahmadi
z.yarahmadi@gmail.com
true
1
Islamic Azad University
Islamic Azad University
Islamic Azad University
LEAD_AUTHOR
S.
Moradi
sirousmoradi@gmail.com
true
2
Arak Unversity
Arak Unversity
Arak Unversity
AUTHOR
ORIGINAL_ARTICLE
Relation Between Wiener, Szeged and Detour Indices
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
2014-12-01T11:23:20
2018-05-25T11:23:20
45
51
10.22052/ijmc.2014.7776
Wiener index
Szeged index
Detour index
N.
Azimi
ghorbani30@gmail.com
true
1
Srtt Univ.
Srtt Univ.
Srtt Univ.
AUTHOR
M.
Roumena
modjtaba.ghorbani@gmail.com
true
2
Srtt Univ.
Srtt Univ.
Srtt Univ.
AUTHOR
M.
Ghorbani
mghorbani@sru.ac.ir
true
3
Department of mathematics, Shahid Rajaee Teacher Training University
Department of mathematics, Shahid Rajaee Teacher Training University
Department of mathematics, Shahid Rajaee Teacher Training University
LEAD_AUTHOR