Let [Formula: see text] be a simple connected graph. The first Zagreb index denoted by [Formula: see text] is defined as [Formula: see text]. We present a lower bound for [Formula: see text] in terms of order and edge-vertex domination number for trees and characterized the extremal trees attaining the bound.
No takes yet. Share an insight, caveat, or question.
Kumar et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: