The principal and supreme concern in medical information systems is the issue of safe guarding the electronic health records of patients. Defending a health care industry's computer network against attacks on its nodes and links requires placing mobile guards on the nodes of a network. Bloom graph topologies are attractive networks that are potential structures for massively parallel computers. This article focuses on the computation of exact value of the parameters which gives the minimum number of guards required to protect the bloom networks with a linear time algorithm. This research highlights the benefits of locating domination sets in locating the minimum number of detection devices or cyber security employees (mobile guards) to be deployed on the significant servers (nodes) of the bloom's topology (healthcare network) which is essential for securing the network to fight against cyber threats.
A graph is SSP (Super Strongly Perfect) if all of its (induced) subgraph H in G obsesses a (minimal dominating set) MDS that link up all of its cliques (maximal) in H. It is offered the cyclic structure of k-sun flower graph, friendship and Jahangir graphs and later explored their SSP parameters like counting of colourability, MDS (minimal dominating set) and cliques (maximal) of these graphs.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.