ORIGINAL_ARTICLE
Stirling Numbers and Generalized Zagreb Indices
>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.
http://ijmc.kashanu.ac.ir/article_15092_004e2848d32ee0215ed2fb32745ab419.pdf
2017-03-01T11:23:20
2017-09-23T11:23:20
1
5
10.22052/ijmc.2017.15092
Simple Graph
Zagreb index
Stirling number
T.
Doslic
doslic@grad.hr
true
1
1Department of Mathematics, Faculty of Civil Engineering, University of Zagreb,
1Department of Mathematics, Faculty of Civil Engineering, University of Zagreb,
1Department of Mathematics, Faculty of Civil Engineering, University of Zagreb,
AUTHOR
S.
Sedghi
sedghi_gh@yahoo.com
true
2
Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshar, Iran
Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshar, Iran
Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshar, Iran
LEAD_AUTHOR
N.
Shobe
nabi_shobe@yahoo.com
true
3
Department of Mathematics, Babol Branch,
Islamic Azad
University, Babol, Iran
Department of Mathematics, Babol Branch,
Islamic Azad
University, Babol, Iran
Department of Mathematics, Babol Branch,
Islamic Azad
University, Babol, Iran
AUTHOR
ORIGINAL_ARTICLE
Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
>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.
http://ijmc.kashanu.ac.ir/article_15093_69c2d9a26c71db3e788dad505b39bd47.pdf
2017-03-01T11:23:20
2017-09-23T11:23:20
7
23
10.22052/ijmc.2017.15093
Characteristic polynomial
Matching polynomial
Fullerene graph
F.
Taghvaee
taghvaei19@yahoo.com
true
1
University of Kashan
University of Kashan
University of Kashan
AUTHOR
G.
Fath-Tabar
fathtabar@kashanu.ac.ir
true
2
University of Kashan
University of Kashan
University of Kashan
LEAD_AUTHOR
ORIGINAL_ARTICLE
The Topological Indices of some Dendrimer Graph
>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.
http://ijmc.kashanu.ac.ir/article_15413_409103bb75ca603e8d9761bff25c9f9d.pdf
2017-03-01T11:23:20
2017-09-23T11:23:20
25
35
10.22052/ijmc.2017.15413
Topological index
Dendrimer
Wiener index
Hyper Wiener index
M.
Darafsheh
true
1
School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran
School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran
School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran
AUTHOR
M.
Namdari
true
2
Department of Mathematics, Shahid Chamran University of Ahvaz, Ahvaz, Iran
Department of Mathematics, Shahid Chamran University of Ahvaz, Ahvaz, Iran
Department of Mathematics, Shahid Chamran University of Ahvaz, Ahvaz, Iran
AUTHOR
S.
Shokrolahi
shokrolahisara@yahoo.com
true
3
Department of Mathematics, Shahid Chamran University of Ahvaz, Ahvaz, Iran.
Department of Mathematics, Shahid Chamran University of Ahvaz, Ahvaz, Iran.
Department of Mathematics, Shahid Chamran University of Ahvaz, Ahvaz, Iran.
LEAD_AUTHOR
ORIGINAL_ARTICLE
On the Multiplicative Zagreb Indices of Bucket Recursive Trees
>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$.
http://ijmc.kashanu.ac.ir/article_15385_a531d26c2c53b9e69340e3275863a39d.pdf
2017-03-01T11:23:20
2017-09-23T11:23:20
37
45
10.22052/ijmc.2017.15385
Bucket recursive trees
Multiplicative Zagreb index
Moment generating function
Moments
R.
Kazemi
r.kazemi@sci.ikiu.ac.ir
true
1
Imam Khomeini international university
Imam Khomeini international university
Imam Khomeini international university
LEAD_AUTHOR
ORIGINAL_ARTICLE
The Conditions of the Violations of Le Chatlier’s Principle in Gas Reactions at Constant T and P
>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.
http://ijmc.kashanu.ac.ir/article_40877_16bdbaff387a8d0a5a4560717fd626f1.pdf
2017-03-01T11:23:20
2017-09-23T11:23:20
47
52
10.22052/ijmc.2016.40877
Violation of Le Chatelier
Principle gas reaction
Mixture
Chemical equilibria
Chemical potential moderation
M.
Torabi Rad
morteza.0mtr0@yahoo.com
true
1
University of Qom, Qom, Iran
University of Qom, Qom, Iran
University of Qom, Qom, Iran
AUTHOR
A.
Abbasi
a.abbasi@qom.ac.ir
true
2
University of Qom, Qom, Iran
University of Qom, Qom, Iran
University of Qom, Qom, Iran
LEAD_AUTHOR
ORIGINAL_ARTICLE
Neighbourly Irregular Derived Graphs
>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.
http://ijmc.kashanu.ac.ir/article_40878_6696d4ef694484d8cbd24a2e135f2db7.pdf
2017-03-01T11:23:20
2017-09-23T11:23:20
53
60
10.22052/ijmc.2016.40878
Neighbourly irregular
Derived graphs
Product graphs
B.
Basavanagoud
b.basavanagoud@gmail.com
true
1
KARNATAK UNIVERSITY DHARWAD
KARNATAK UNIVERSITY DHARWAD
KARNATAK UNIVERSITY DHARWAD
LEAD_AUTHOR
S.
Patil
shreekantpatil949@gmail.com
true
2
Karnatak University
Karnatak University
Karnatak University
AUTHOR
V. R.
Desai
veenardesai6f@gmail.com
true
3
Karnatak University
Karnatak University
Karnatak University
AUTHOR
M.
Tavakoli
m_tavakoli@um.ac.ir
true
4
Ferdowsi University of Mashhad
Ferdowsi University of Mashhad
Ferdowsi University of Mashhad
AUTHOR
A. R.
Ashrafi
ashrafi@kashanu.ac.ir
true
5
University of Kashan
University of Kashan
University of Kashan
AUTHOR
ORIGINAL_ARTICLE
Splice Graphs and their Vertex-Degree-Based Invariants
>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.
http://ijmc.kashanu.ac.ir/article_42671_ee6308a68005ada646980828d47bfe6d.pdf
2017-03-01T11:23:20
2017-09-23T11:23:20
61
70
10.22052/ijmc.2017.42671
Vertex degree
Graph invariant
Splice
M.
Azari
mahdie.azari@gmail.com
true
1
Islamic Azad University
Islamic Azad University
Islamic Azad University
LEAD_AUTHOR
F.
Falahati-Nezhad
farzanehfalahati_n@yahoo.com
true
2
Safadasht Branch, Islamic Azad University
Safadasht Branch, Islamic Azad University
Safadasht Branch, Islamic Azad University
AUTHOR
ORIGINAL_ARTICLE
An Upper Bound on the First Zagreb Index in Trees
>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.
http://ijmc.kashanu.ac.ir/article_42995_ffcfc35832452f53e30dde47f51eb517.pdf
2017-03-01T11:23:20
2017-09-23T11:23:20
71
82
10.22052/ijmc.2017.42995
First Zagreb index
First Zagreb coindex
Tree
Chemical tree
R.
Rasi
true
1
Azarbaijan Shahid Madani University, Tabriz, Iran
Azarbaijan Shahid Madani University, Tabriz, Iran
Azarbaijan Shahid Madani University, Tabriz, Iran
AUTHOR
S.
Sheikholeslami
true
2
Azarbaijan Shahid Madani University, Tabriz, Iran
Azarbaijan Shahid Madani University, Tabriz, Iran
Azarbaijan Shahid Madani University, Tabriz, Iran
AUTHOR
A.
Behmaram
behmarammath@gmail.com
true
3
Institute for Research in Fundamental Sciences, Tehran, Iran
Institute for Research in Fundamental Sciences, Tehran, Iran
Institute for Research in Fundamental Sciences, Tehran, Iran
LEAD_AUTHOR
ORIGINAL_ARTICLE
Distance-Based Topological Indices and Double graph
>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.
http://ijmc.kashanu.ac.ir/article_43073_2d77910a1fe8582c483e43f4ec4579b4.pdf
2017-03-01T11:23:20
2017-09-23T11:23:20
83
91
10.22052/ijmc.2017.43073
Wiener index
Harary index
Double graph
M.
Jamil
m.kamran.sms@gmail.com
true
1
ABDUS SALAM SCHOOL OF MATHEMATICAL SCIENCES, GOVERNMENT COLLEGE UNIVERSITY, LAHORE, PAKISTAN.
ABDUS SALAM SCHOOL OF MATHEMATICAL SCIENCES, GOVERNMENT COLLEGE UNIVERSITY, LAHORE, PAKISTAN.
ABDUS SALAM SCHOOL OF MATHEMATICAL SCIENCES, GOVERNMENT COLLEGE UNIVERSITY, LAHORE, PAKISTAN.
LEAD_AUTHOR