@article {
author = {Doslic, T. and Sedghi, S. and Shobe, N.},
title = {Stirling Numbers and Generalized Zagreb Indices},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {8},
number = {1},
pages = {1-5},
year = {2017},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2017.15092},
abstract = {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.},
keywords = {Simple Graph,Zagreb index,Stirling number},
url = {https://ijmc.kashanu.ac.ir/article_15092.html},
eprint = {https://ijmc.kashanu.ac.ir/article_15092_b7bb85d9dbe4ac40d6d223adc42453dd.pdf}
}
@article {
author = {Taghvaee, F. and Fath-Tabar, G.},
title = {Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {8},
number = {1},
pages = {7-23},
year = {2017},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2017.15093},
abstract = {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.},
keywords = {Characteristic polynomial,Matching polynomial,Fullerene graph},
url = {https://ijmc.kashanu.ac.ir/article_15093.html},
eprint = {https://ijmc.kashanu.ac.ir/article_15093_be5ca1f23c477021c246d4c612236dc6.pdf}
}
@article {
author = {Darafsheh, M. and Namdari, M. and Shokrolahi, S.},
title = {The Topological Indices of some Dendrimer Graphs},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {8},
number = {1},
pages = {25-35},
year = {2017},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2017.15413},
abstract = {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.},
keywords = {topological index,Dendrimer,Wiener index,Hyper Wiener index},
url = {https://ijmc.kashanu.ac.ir/article_15413.html},
eprint = {https://ijmc.kashanu.ac.ir/article_15413_df8b2c0cfc3d418f4b890e723474b4cd.pdf}
}
@article {
author = {Kazemi, R.},
title = {On the Multiplicative Zagreb Indices of Bucket Recursive Trees},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {8},
number = {1},
pages = {37-45},
year = {2017},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2017.15385},
abstract = {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$.},
keywords = {Bucket recursive trees,Multiplicative Zagreb index,Moment generating function,Moments},
url = {https://ijmc.kashanu.ac.ir/article_15385.html},
eprint = {https://ijmc.kashanu.ac.ir/article_15385_09d45a56a3e6e888884635bfc073bf60.pdf}
}
@article {
author = {Torabi Rad, M. and Abbasi, A.},
title = {The Conditions of the Violations of Le Chatlier’s Principle in Gas Reactions at Constant T and P},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {8},
number = {1},
pages = {47-52},
year = {2017},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2016.40877},
abstract = {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.},
keywords = {Violation of Le Chatelier,Principle gas reaction,Mixture,Chemical equilibria,Chemical potential moderation},
url = {https://ijmc.kashanu.ac.ir/article_40877.html},
eprint = {https://ijmc.kashanu.ac.ir/article_40877_8ff2dc0bd3328b97fc4cc4983d8d533a.pdf}
}
@article {
author = {Basavanagoud, B. and Patil, S. and Desai, V. R. and Tavakoli, M. and Ashrafi, A. R.},
title = {Neighbourly Irregular Derived Graphs},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {8},
number = {1},
pages = {53-60},
year = {2017},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2016.40878},
abstract = {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.},
keywords = {Neighbourly irregular,Derived graphs,Product graphs},
url = {https://ijmc.kashanu.ac.ir/article_40878.html},
eprint = {https://ijmc.kashanu.ac.ir/article_40878_84e728f990f1722c2fdf11f8aec1c6e0.pdf}
}
@article {
author = {Azari, M. and Falahati-Nezhad, F.},
title = {Splice Graphs and their Vertex-Degree-Based Invariants},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {8},
number = {1},
pages = {61-70},
year = {2017},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2017.42671},
abstract = {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.},
keywords = {vertex degree,graph invariant,Splice},
url = {https://ijmc.kashanu.ac.ir/article_42671.html},
eprint = {https://ijmc.kashanu.ac.ir/article_42671_842a36edd0ad831bf464f22081c22654.pdf}
}
@article {
author = {Rasi, R. and Sheikholeslami, S. and Behmaram, A.},
title = {An Upper Bound on the First Zagreb Index in Trees},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {8},
number = {1},
pages = {71-82},
year = {2017},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2017.42995},
abstract = {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.},
keywords = {First Zagreb index,First Zagreb coindex,tree,Chemical tree},
url = {https://ijmc.kashanu.ac.ir/article_42995.html},
eprint = {https://ijmc.kashanu.ac.ir/article_42995_aceaeaa2290cdaa2217a2205d4bda5af.pdf}
}
@article {
author = {Jamil, M.},
title = {Distance-Based Topological Indices and Double graph},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {8},
number = {1},
pages = {83-91},
year = {2017},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2017.43073},
abstract = {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.},
keywords = {Wiener index,Harary index,Double graph},
url = {https://ijmc.kashanu.ac.ir/article_43073.html},
eprint = {https://ijmc.kashanu.ac.ir/article_43073_1e1bbd86540bb1e1baabd2a8f90bff47.pdf}
}