The Fast Search Number of a Complete k-Partite Graph
- 95 Downloads
Research on graph searching has recently gained interest in computer science, mathematics, and physics. This paper studies fast searching of a fugitive in a graph, a model that was introduced by Dyer et al. (in: Fleischer, Xu (eds.) Algorithmic aspects in information and management, Springer, New York, 2008). We provide lower bounds and upper bounds on the fast search number (i.e., the minimum number of searchers required for capturing the fugitive) of complete k-partite graphs. We also investigate some special classes of complete k-partite graphs, such as complete bipartite graphs and complete split graphs. We solve the open problem of determining the fast search number of complete bipartite graphs, and present upper and lower bounds on the fast search number of complete split graphs.
KeywordsFast searching Complete k-partite graph Bipartite graph Split graph
The authors would like to thank the anonymous referees for their valuable comments and suggestions, which improved the presentation of this paper.
- 13.Xue, Y., Yang, B., Zhong, F., Zilles, S.: Fast searching on complete k-partite graphs. In: International Conference on Combinatorial Optimization and Applications, pp. 159–174. Springer (2016)Google Scholar