General multiplicative Zagreb indices of unicyclic graphs
Alfuraidan, Monther R., Balachandran Selvaraj and Tomáš Vetrík
Full PDF
carpathian_2021_37_1_01_11DOI: https://doi.org/10.37193/CJM.2021.01.01
General multiplicative Zagreb indices generalize well-known multiplicative Zagreb indices of graphs. We present lower and upper bounds on the general multiplicative Zagreb indices for unicyclic graphs with given number of vertices and diameter/number of pendant vertices/cycle of given length. All bounds are best possible. Bounds on the classical multiplicative Zagreb indices of unicyclic graphs are corollaries of the general results.
Additional Information
| Author(s) | Alfuraidan, Monther R., Balachandran Selvaraj, Tomáš Vetrík |
|---|
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration