Bounds on the Connected Forcing Number of a Graph

Randy Davila,Michael A. Henning,Colton Magnant,Ryan Pepper

Graphs and Combinatorics（2018）

引用 10|浏览13

暂无评分

摘要

In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph. We provide sharp upper and lower bounds on the connected forcing number in terms of the minimum degree, maximum degree, girth, and order of the graph.

查看译文

关键词

Zero forcing sets, Zero forcing number, Connected dominating sets, Connected domination number, Girth, 05C69, 05C50

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要