The Balaban index and the sum-Balaban index of a graph [Formula: see text] are defined as [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] is the distance sum of vertex [Formula: see text] in [Formula: see text], [Formula: see text] is the number of edges and [Formula: see text] is the cyclomatic number of [Formula: see text]. A connected graph [Formula: see text] is said to be a cactus if each of its blocks is either a cycle or an edge. In this paper, we determine the maximum values of Balaban index and sum-Balaban index and characterize the corresponding extremal graphs among all cacti with [Formula: see text] vertices and [Formula: see text] cycles.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.