Work

Friendly Domination in Clustered Networks: A Block-Star Model for Peer Support and Balanced Friendship Connections.

Year: 2027
Type: article
Abstract: In this paper, we characterize and enumerate friendly dominating sets in block stars, proving gamma_f(B)=t+1, where t counts pendant parts. For friendship graphs, Phi_{W_m}(x)=x(1+x^2)^m+2^m x^m, yielding gamma_f(W_m)=1 and 2^{m+1} admissible sets. For fixed nonpendant sizes s_1,...,s_q, adding pendant vertices cannot increase the total count. Sets omitting the common vertex exist exactly when t\leq\sum_i s_i-2q, with minimum size t+q attained by \prod_i s_i sets. These results model peer selection with friendship coverage and local balance.
Language: English
Open Access status: bronze
OpenAlex ID: W7234057533
Cites: 3
Cited by:
Related to: 10