J. Maria Regila Baby*, K. Uma Samundesvari
Computer Systems Science and Engineering, Vol.45, No.3, pp. 2405-2415, 2023, DOI:10.32604/csse.2023.032240
Abstract 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… More >
Login
Register
