This paper investigates maximum Zagreb connection indices in trees with a defined matching number, suggesting possible extremal graph configurations.
The first, second Zagreb connection indices and modified first Zagreb connection index are defined as \(Z{C_1}(G)={∑_{{v∈ V(G)}} {{τ _G}^2(v)} }\), \(ZC{}₂(G)=∑uv∈ E(G)^{}τ{}G(u)τ{}G(v)\) and \(ZC{}₁(G)=∑v∈ V(G)^{}d{}G(v)τ{}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.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: