• Corpus ID: 117054281

Iteration Index of a Zero Forcing Set in a Graph

@article{Chilakamarri2011IterationIO,
  title={Iteration Index of a Zero Forcing Set in a Graph},
  author={Kiran B. Chilakamarri and Nathaniel Dean and Cong X. Kang and Eunjeong Yi},
  journal={arXiv: Combinatorics},
  year={2011}
}
Let each vertex of a graph G = (V (G),E(G)) be given one of two colors, say, “black” and “white”. Let Z denote the (initial) set of black vertices of G. The color-change rule converts the color of a vertex from white to black if the white vertex is the only white neighbor of a black vertex. The set Z is said to be a zero forcing set of G if all vertices of G will be turned black after finitely many applications of the color-change rule. The zero forcing number of G is the minimum of |Z| over… 
On Zero Forcing Number of Permutation Graphs
TLDR
Perpetual permutation graphs G σ satisfying Z(G σ ) = n for a graph G that is a nearly complete graph, a complete k-partitegraph, a cycle, and a path, respectively, on n vertices are characterized.
On zero forcing number of graphs and their complements
TLDR
The zero forcing number, Z(G), of a graph G is the minimum cardinality of a set S of black vertices such that V(G) is turned black after finitely many applications of "the color-change rule".
A comparison between the Metric Dimension and Zero Forcing Number of Line Graphs
The metric dimension dim(G) of a graph G is the minimum number of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices. The zero forcing
Connected zero forcing sets and connected propagation time of graphs
The zero forcing number $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ with colored (black) vertices which forces the set $V(G)$ to be colored (black) after some times. "color change
Probabilistic Zero Forcing in Graphs
The \emph{zero forcing number} $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V(G)\setminusS$ are colored white) such that $V(G)$ is turned
A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
The metric dimension dim(G) of a graph G is the minimum number of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices. The zero forcing
Multi-color Forcing in Graphs
TLDR
An upper bound on the number of steps required to terminate a forcing procedure in terms of the number-of- vertices in the graph on which the procedure is being applied is given.
...
...

References

SHOWING 1-8 OF 8 REFERENCES
Zero forcing parameters and minimum rank problems
On minimum rank and zero forcing sets of a graph
An upper bound for the minimum rank of a graph
Introduction to Graph Theory
TLDR
Gary Chartrand and Ping Zhang's lively and engaging style, historical emphasis, unique examples and clearly-written proof techniques make it a sound yet accessible text that stimulates interest in an evolving subject and exploration in its many applications.
Periods, Lefschetz numbers and entropy for a class of maps on a bouquet of circles
We consider some smooth maps on a bouquet of circles. For these maps we can compute the number of fixed points, the existence of periodic points and an exact formula for topological entropy. We use
Algebraic Topology: An Introduction
TLDR
Professor Massey's book developed from lecture notes of courses taught to Yale undergraduate and graduate students over a period of several years, and is the author of numerous research articles on algebraic topology and related topics.
The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
We study the maximum possible multiplicity of an eigenvalue of a matrix whose graph is a tree, expressing that maximum multiplicity in terms of certain parameters associated with the tree.