On maximum Zagreb connection indices for trees with fixed matching number
The first, second Zagreb connection indices and modified first Zagreb connection index are defined as \(Z{C_1}(G)={\sum\limits_{{v\in V(G)}} {{\tau _G}^2(v)} }\), \(ZC{}_{2}(G)=\displaystyle\sum_{uv\in E(G)}^{}\tau{}_{G}(u)\tau{}_{G}(v)\) and \(ZC{}_{1}^{\ast }(G)=\displaystyle\sum_{v\in V(G)}^{}d{}_{G}(v)\tau{}_{G}(v)\), respectively. In this paper, we consider the maximum values of \(Z{C_1}(G)\), \(Z{C_2}(G)\), \(Z{C_1}^{*}(G)\) of \(n\)-vertex trees with fixed matching number \(m\) and the extremal graphs are also characterized.
Authors
- G.L. Ding (ORCID: https://orcid.org/0000-0003-3745-1588)
- Lingping Zhong (ORCID: https://orcid.org/0000-0002-7283-9927)
- Xia Wang (ORCID: https://orcid.org/0000-0002-4569-8778)
Publication Details
- Journal
- Ars Combinatoria
- Published
- 2025-09-30
- DOI
- https://doi.org/10.61091/ars164-07
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00