The fast search number of a Cartesian product of graphs

Keywords

Cartesian product, Mathematics, Product (mathematics), Combinatorics, Discrete mathematics

References

• Graph Searching and Related ProblemsAnthony Bonato, Boting Yang — 2013
• The Game of Cops and Robbers on GraphsAnthony Bonato, Richard J. Nowakowski — 2011
• SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEYBrian Alspach — 2006
• Fast-mixed searching and related problems on graphsBoting Yang — 2013
• Monotonicity in Graph SearchingDaniel Bienstock, Paul Seymour — 1991
• The complexity of searching a graphNimrod Megiddo, S. L. Hakimi, M. R. Garey — 1981
• Fast edge searching and fast searching on graphsBoting Yang — 2011
• Fast searching games on graphsDonald Stanley, Boting Yang — 2011
• The treewidth and pathwidth of hypercubesL. Sunil Chandran, Telikepalli Kavitha — 2006
• An annotated bibliography on guaranteed graph searchingFedor V. Fomin, Dimitrios M. Thilikos — 2008
• Three-fast-searchable graphsDariusz Dereniowski, Öznur Yaşar Diner, Danny Dyer — 2013
• Topological BandwidthFillia Makedon, Christos H. Papadimitriou, I. Hal Sudborough — 1983
• Graph searchingRichard Krueger — 2005
• The game of cops and robbers on graphs2012
• Fast Searching on Complete k-partite GraphsYuan Xue, Boting Yang, Farong Zhong — 2016
• Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey)D. Bienstock — 1989
• On the Fast Searching ProblemD. Dyer, Boting Yang, Öznur Yaşar Diner — 2008
• Pursuit-evasion in a graphT. Parsons — 1978
• Searching and PebblingC. Papadimitriou — 1983

Cited by

• The Fast Search Number of a Complete k-Partite GraphYuan Xue, Boting Yang, Farong Zhong — 2018
• Search Numbers in Networks with Special TopologiesBoting Yang, Runtao Zhang, Yi Cao — 2019
• Lower Bounds and Algorithms for Searching NetworksYuan Xue — 2019
• Fast searching on cactus graphsYuan Xue, Boting Yang, Sandra Zilles — 2023
• Edge searching and fast searching with constraintsLusheng Wang, Boting Yang — 2024
• Network DecontaminationNicolas Nisse — 2019
• On the Cooperative Graph Searching ProblemChin-Fu Lin, O. Navrátil, Sheng-Lung Peng — 2017

Related papers

• A Note on Total and Paired Domination of Cartesian Product GraphsKeerti Choudhary, Susan S. Margulies, Illya V. Hicks — 2011
• Lower bounds on the independence number of certain graphs of odd girth at least sevenAnders Sune Pedersen, Dieter Rautenbach, Friedrich Regen — 2011
• Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphsShuangliang Tian, Ping Chen, Yabin Shao — 2013
• Decycling Cartesian Products of Two CyclesDavid A. Pike, Yubo Zou — 2005
• Exact square coloring of graphs resulting from some graph operations and productsPriyamvada, B. S. Panda — 2022
• Random Subgraphs in Sparse GraphsFelix Joos — 2013