منابع مشابه
On the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کاملNote on forcing pairs
The notion of forcing pairs is located in the study of quasi-random graphs. Roughly speaking, a pair of graphs (F, F ′) is called forcing if the following holds: Suppose for a sequence of graphs (Gn) there is a p > 0 such that the number of copies of F and the number of copies of F ′ in every graph Gn of the sequence (Gn) is approximately the same as the expected value in the random graph G(n, ...
متن کاملa note on the zero divisor graph of a lattice
abstract. let $l$ be a lattice with the least element $0$. an element $xin l$ is a zero divisor if $xwedge y=0$ for some $yin l^*=lsetminus left{0right}$. the set of all zero divisors is denoted by $z(l)$. we associate a simple graph $gamma(l)$ to $l$ with vertex set $z(l)^*=z(l)setminus left{0right}$, the set of non-zero zero divisors of $l$ and distinct $x,yin z(l)^*$ are adjacent if and only...
متن کاملUsing variants of zero forcing to bound the inertia set of a graph
Zero forcing is a combinatorial game played on a graph with a goal of changing the color of every vertex at minimal cost. This leads to a parameter known as the zero forcing number that can be used to give an upper bound for the maximum nullity of a matrix associated with the graph. A variation on the zero forcing game is introduced that can be used to give an upper bound for the maximum nullit...
متن کاملZero forcing propagation time on oriented graphs
Zero forcing is an iterative coloring procedure on a graph that starts by initially coloring vertices white and blue and then repeatedly applies the following rule: if any blue vertex has a unique (out-)neighbor that is colored white, then that neighbor is forced to change color from white to blue. An initial set of blue vertices that can force the entire graph to blue is called a zero forcing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2019
ISSN: 1081-3810
DOI: 10.13001/1081-3810.3822