General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number

Tomáš Vetrík () and Selvaraj Balachandran
Additional contact information
Tomáš Vetrík: University of the Free State
Selvaraj Balachandran: University of the Free State

Journal of Combinatorial Optimization, 2020, vol. 40, issue 4, No 7, 953-973

Abstract: Abstract The first general multiplicative Zagreb index of a graph G is defined as $$P_1^a (G) = \prod _{v \in V(G)} (deg_G (v))^a$$ P 1 a ( G ) = ∏ v ∈ V ( G ) ( d e g G ( v ) ) a and the second general multiplicative Zagreb index is $$P_2^a (G) = \prod _{v \in V(G)} (deg_G (v))^{a \, deg_G (v)}$$ P 2 a ( G ) = ∏ v ∈ V ( G ) ( d e g G ( v ) ) a d e g G ( v ) , where V(G) is the vertex set of G, $$deg_{G} (v)$$ d e g G ( v ) is the degree of v in G and $$a \ne 0$$ a ≠ 0 is a real number. We present lower and upper bounds on the general multiplicative Zagreb indices for trees and unicyclic graphs of given order with a perfect matching. We also obtain lower and upper bounds for trees and unicyclic graphs of given order and matching number. All the trees and unicyclic graphs which achieve the bounds are presented, thus our bounds are sharp. Bounds for the classical multiplicative Zagreb indices are special cases of our theorems and those bounds are new results as well.

Keywords: Tree; Unicyclic graph; Multiplicative Zagreb index; Matching (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00643-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:40:y:2020:i:4:d:10.1007_s10878-020-00643-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00643-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().