A simple approach to order the multiplicative Zagreb indices of connected graphs
The first ($Pi_1$) and the second $(Pi_2$) multiplicative Zagreb indices of a connected graph $G$, with vertex set $V(G)$ and edge set $E(G)$, are defined as $Pi_1(G) = prod_{u in V(G)} {d_u}^2$ and $Pi_2(G) = prod_{uv in E(G)} {d_u}d_{v}$, respectively, where ${d_u}$ denotes the degree of the verte...
Main Author: | Mehdi Eliasi |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2012-12-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=2146&_ob=61a92ef69e13895fcd946bfe86a93cd7&fileName=full_text.pdf. |
Similar Items
-
Sharp Bounds on the Generalized Multiplicative First Zagreb Index of Graphs with Application to QSPR Modeling
by: Sakander Hayat, et al.
Published: (2023-05-01) -
Extremal unicyclic and bicyclic graphs with respect to the -index
by: Shehnaz Akhter, et al.
Published: (2017-04-01) -
General Multiplicative Zagreb Indices of Graphs with a Small Number of Cycles
by: Monther R. Alfuraidan, et al.
Published: (2020-04-01) -
Ordering of trees by multiplicative second Zagreb index
by: Mehdi Eliasi, et al.
Published: (2016-03-01) -
First reformulated Zagreb indices of some classes of graphs
by: V. Kaladevi, et al.
Published: (2018-01-01)