2017-09-23T00:14:31Z
http://ijmc.kashanu.ac.ir/?_action=export&rf=summon&issue=2948
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2017
8
1
Stirling Numbers and Generalized Zagreb Indices
T.
Doslic
S.
Sedghi
N.
Shobe
We show how generalized Zagreb indices $M_1^k(G)$ can be computed by using a simple graph polynomial and Stirling numbers of the second kind. In that way we explain and clarify the meaning of a triangle of numbers used to establish the same result in an earlier reference.
Simple Graph
Zagreb index
Stirling number
2017
03
01
1
5
http://ijmc.kashanu.ac.ir/article_15092_004e2848d32ee0215ed2fb32745ab419.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2017
8
1
Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
F.
Taghvaee
G.
Fath-Tabar
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matching polynomial, (-1)^km(G, k), in a regular graph. In the rest of this paper, we apply these relations for finding 5,6-matchings of fullerene graphs.
Characteristic polynomial
Matching polynomial
Fullerene graph
2017
03
01
7
23
http://ijmc.kashanu.ac.ir/article_15093_69c2d9a26c71db3e788dad505b39bd47.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2017
8
1
The Topological Indices of some Dendrimer Graph
M.
Darafsheh
M.
Namdari
S.
Shokrolahi
In this paper the Wiener and hyper Wiener index of two kinds of dendrimer graphs are determined. Using the Wiener index formula, the Szeged, Schultz, PI and Gutman indices of these graphs are also determined.
Topological index
Dendrimer
Wiener index
Hyper Wiener index
2017
03
01
25
35
http://ijmc.kashanu.ac.ir/article_15413_409103bb75ca603e8d9761bff25c9f9d.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2017
8
1
On the Multiplicative Zagreb Indices of Bucket Recursive Trees
R.
Kazemi
Bucket recursive trees are an interesting and natural generalization of ordinary recursive trees and have a connection to mathematical chemistry. In this paper, we give the lower and upper bounds for the moment generating function and moments of the multiplicative Zagreb indices in a randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$. Also, we consider the ratio of the multiplicative Zagreb indices for different values of $n$ and $b$. All our results reduce to the ordinary recursive trees for $b=1$.
Bucket recursive trees
Multiplicative Zagreb index
Moment generating function
Moments
2017
03
01
37
45
http://ijmc.kashanu.ac.ir/article_15385_a531d26c2c53b9e69340e3275863a39d.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2017
8
1
The Conditions of the Violations of Le Chatlier’s Principle in Gas Reactions at Constant T and P
M.
Torabi Rad
A.
Abbasi
Le Chatelier's principle is used as a very simple way to predict the effect of a change in conditions on a chemical equilibrium. . However, several studies have reported the violation of this principle, still there is no reported simple mathematical equation to express the exact condition of violation in the gas phase reactions. In this article, we derived a simple equation for the violation of Le Chatelier's principle for the ideal gas reactions at the constant temperature and pressure.
Violation of Le Chatelier
Principle gas reaction
Mixture
Chemical equilibria
Chemical potential moderation
2017
03
01
47
52
http://ijmc.kashanu.ac.ir/article_40877_16bdbaff387a8d0a5a4560717fd626f1.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2017
8
1
Neighbourly Irregular Derived Graphs
B.
Basavanagoud
S.
Patil
V. R.
Desai
M.
Tavakoli
A. R.
Ashrafi
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
Neighbourly irregular
Derived graphs
Product graphs
2017
03
01
53
60
http://ijmc.kashanu.ac.ir/article_40878_6696d4ef694484d8cbd24a2e135f2db7.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2017
8
1
Splice Graphs and their Vertex-Degree-Based Invariants
M.
Azari
F.
Falahati-Nezhad
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
Vertex degree
Graph invariant
Splice
2017
03
01
61
70
http://ijmc.kashanu.ac.ir/article_42671_ee6308a68005ada646980828d47bfe6d.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2017
8
1
An Upper Bound on the First Zagreb Index in Trees
R.
Rasi
S.
Sheikholeslami
A.
Behmaram
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
First Zagreb index
First Zagreb coindex
Tree
Chemical tree
2017
03
01
71
82
http://ijmc.kashanu.ac.ir/article_42995_ffcfc35832452f53e30dde47f51eb517.pdf
Iranian Journal of Mathematical Chemistry
Iranian J. Math. Chem.
2228-6489
2228-6489
2017
8
1
Distance-Based Topological Indices and Double graph
M.
Jamil
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topological indices.
Wiener index
Harary index
Double graph
2017
03
01
83
91
http://ijmc.kashanu.ac.ir/article_43073_2d77910a1fe8582c483e43f4ec4579b4.pdf