Zero forcing is a graph propagation process for which vertices fill-in (or propagate information to) neighbor vertices if all neighbors except for one, are filled. The zero-forcing number is the smallest number of vertices that must be filled to begin the process so that the entire graph or network becomes filled. In this paper, bounds are provided on the zero forcing number of generalized hierarchical products.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。