Friendly Domination in Clustered Networks: A Block-Star Model for Peer Support and Balanced Friendship Connections.
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.
Authors
- Jamil Hamja
- Mohammad Yusop
- Aliazer Jinang
- Aldaser Askalani
Institutions
- Mindanao State University - Tawi-Tawi College of Technology and Oceanography (PH)
Publication Details
- Journal
- International journal of mathematics and computer science
- Published
- 2026-11-17
- DOI
- https://doi.org/10.69793/ijmcs/01.2027/hajy
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00