21,359 research outputs found
Inequalities for Euler-Mascheroni constant
The aim of this paper is to establish new inequalities for the
Euler-Mascheroni by the continued fraction method
Trees with Maximum p-Reinforcement Number
Let be a graph and a positive integer. The -domination
number \g_p(G) is the minimum cardinality of a set with
for all . The -reinforcement
number is the smallest number of edges whose addition to results
in a graph with \g_p(G')<\g_p(G). Recently, it was proved by Lu et al.
that for a tree and . In this paper, we
characterize all trees attaining this upper bound for
- β¦