Total forcing sets and zero forcing sets in trees
نویسندگان
چکیده
منابع مشابه
Zero forcing sets and the minimum rank of graphs ∗
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. This paper introduces a new graph parameter, Z(G), that is the minimum size of a zero forcing set of vertices and uses it to bound the minimum rank for numerous families of graphs, often e...
متن کاملRadius-forcing sets in graphs
Let G be a connected graph of order p and let 0 ::f. s ~ V ( G). Then S is a rad(G)-forcing set (or a radius-forcing set of G) if, for each v E V(G), there exists v' E S with dc(v, v') ?: rad(G). The cardinality of a smallest radius-forcing set of G is called the radius-forcing number of G and is denoted by rf(G). A graph G is called a randomly k-forcing graph for a positive integer k if every ...
متن کاملForcing Total Detour Monophonic Sets in a Graph
For a connected graph G = (V,E) of order at least two, a total detour monophonic set of a graph G is a detour monophonic set S such that the subgraph induced by S has no isolated vertices. The minimum cardinality of a total detour monophonic set of G is the total detour monophonic number of G and is denoted by dmt(G). A subset T of a minimum total detour monophonic set S of G is a forcing total...
متن کاملRudimentary recursion, provident sets and forcing
and call a set A provident if it is transitive and closed under all p-rud-rec functions with p a member of A. * If ζ is the least ordinal not in a provident set A, then ζ is indecomposable, that is, that the sum of two ordinals less than ζ is less than ζ. Conversely, if ζ is indecomposable, η > ζ and p ∈ Jζ , then the Jensen set Jη is is closed under all p-rud rec functions; in particular Jζ is...
متن کاملRigid origami vertices: conditions and forcing sets
We develop an intrinsic necessary and sufficient condition for single-vertex origami crease patterns to be able to fold rigidly. We classify such patterns in the case where the creases are pre-assigned to be mountains and valleys as well as in the unassigned case. We also illustrate the utility of this result by applying it to the new concept of minimal forcing sets for rigid origami models, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2020
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2136