A vertex-degree-based topological index
associates a real number to a graph
G which is invariant under graph isomorphism. It is defined in terms of the degrees of the vertices of
G and plays an important role in chemical graph theory, especially in
[...] Read more.
A vertex-degree-based topological index
associates a real number to a graph
G which is invariant under graph isomorphism. It is defined in terms of the degrees of the vertices of
G and plays an important role in chemical graph theory, especially in QSPR/QSAR investigations. A subset of
k edges in
G with no common vertices is called a
k-matching of
G, and the number of such subsets is denoted by
. Recently, this number was naturally extended to weighted graphs, where the weight function is induced by the topological index
. This number was denoted by
and called the
k-matchings of
G with respect to the topological index
. It turns out that
and so for
the
k-matching numbers
can be viewed as
kth order topological indices which involve both the topological index
and the
k-matching numbers. In this work, we solve the extremal value problem for the number of 2-matchings with respect to general sum-connectivity indices
, over the set
of trees with
n vertices, when
is a real number in the interval
Full article