Complete Cototal Roman Domination Number of a Graph for User Preference Identification in Social Media

Many graph domination applications can be expanded to achieve complete cototal domination. If every node in a dominating set is regarded as record server for PC organization, then each affiliated with the organization has direct access document server. It occasionally reasonable believe that this gateway will remain available even if one of scrape servers fails. Because at least two documents’ servers, provides required adaptability non-critical failure such scenarios. In paper, we presented method calculating graph’s roman number. We also examined properties and determined bounds number, its are presented. been observed one’s interest fluctuate over time, therefore inferring them just from own behaviour may inconclusive. However, it able deduce user’s constant some level networking watched similar or related actions. This research proposes considers his channel’s activity, well common tags, persons, organizations their social media posts order establish solid foundation conclusion.