Bounds for the Zero Forcing Number of Graphs with Large Girth
نویسندگان
چکیده
منابع مشابه
Bounds for the Zero-Forcing Number of Graphs with Large Girth
We investigate the zero-forcing number for triangle-free graphs. We improve upon the trivial bound, δ ≤ Z(G) where δ is the minimum degree, in the triangle-free case. In particular, we show that 2δ− 2 ≤ Z(G) for graphs with girth of at least 5, and this can be further improved when G has a small cut set. Lastly, we make a conjecture that the lower bound for Z(G) increases as a function of the g...
متن کامل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...
متن کاملZero forcing number of graphs
A subset S of initially infected vertices of a graph G is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbour, infects this neighbour. The forcing number of G is the minimum cardinality of a forcing set in G. In the present paper, we study the forcing number of various classes o...
متن کاملThe Zero Forcing Number of Circulant Graphs
The zero forcing number of a graph G is the cardinality of the smallest subset of the vertices of G that forces the entire graph using a color change rule. This paper presents some basic properties of circulant graphs and later investigates zero forcing numbers of circulant graphs of the form C[n, {s, t}], while also giving attention to propagation time for specific zero forcing sets.
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Applications of Graphs
سال: 2015
ISSN: 2470-9859
DOI: 10.20429/tag.2015.020201