Location Domination for Generalized Friendship Graphs Analytics

Locating defective elements in a processor network brings the motivation for location dominating sets. In this paper, the location dominating set problem for friendship graphs is solved. Location problems examine the ability to pinpoint the origin of an event. Friendship graphs are used to analyze social networks. Domination in social networks is used to find the most powerful node in such networks and location domination is significant in locating the faulty or the unusable node in that network.