Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
485210 | Procedia Computer Science | 2016 | 8 Pages |
Abstract
Covering problems were first considered in the context of practical motivations to model and locate emergency service facilities. The covering number is an essential tool in the safety of networks, as it gives the minimum number of detection devices required to identify the location of an intruder or a faulty node. In this paper, we provide a graph theory based approach which could be beneficial to keep the network secure. The covering number for complete flower graphs are calculated exactly and their theoretical properties are explored. Our results on flower graphs can be applied to flower like patterns which represent useful frameworks such as anthropology to study the cultural evolution.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
D. Angel, A. Amutha,