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

作　　者：J.Maria Regila Baby K.Uma Samundesvari 

机构地区：[1]Department of Mathematics,Noorul Islam Centre for Higher Education,Kumaracoil,629175,India

出　　处：《Computer Systems Science & Engineering》2023年第6期2405-2415,共11页计算机系统科学与工程（英文）

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

关 键 词：Social media network graph complete cototal roman domination 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]