On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs
In this paper, we showcase the process of using an automated conjecturing program called
TxGraffiti written and maintained by the second author. We begin by proving a conjecture …
TxGraffiti written and maintained by the second author. We begin by proving a conjecture …
[HTML][HTML] On the zero blocking number of rectangular, cylindrical, and Möbius grids
M Beaudouin-Lafon, M Crawford, S Chen… - Discrete Applied …, 2020 - Elsevier
In a zero forcing process, an initial vertex coloring of a graph is updated iteratively according
to the following conversion rule: an uncolored vertex becomes colored if it is the only …
to the following conversion rule: an uncolored vertex becomes colored if it is the only …
[HTML][HTML] Blocking zero forcing processes in Cartesian products of graphs
N Karst, X Shen, DS Troxell, MK Vu - Discrete Applied Mathematics, 2020 - Elsevier
In a zero forcing process, an initial vertex coloring of a graph is updated iteratively according
to the following conversion rule: an uncolored vertex becomes colored if it is the only …
to the following conversion rule: an uncolored vertex becomes colored if it is the only …
Zero forcing versus domination in cubic graphs
R Davila, MA Henning - Journal of Combinatorial Optimization, 2021 - Springer
In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an
initial subset S of colored vertices, with all remaining vertices being non-colored. At each …
initial subset S of colored vertices, with all remaining vertices being non-colored. At each …
Computer assisted discovery: Zero forcing vs vertex cover
In this paper, we showcase the process of using an automated conjecturing program
called\emph {TxGraffiti} written and maintained by the second author. We begin by proving a …
called\emph {TxGraffiti} written and maintained by the second author. We begin by proving a …
On the zero forcing number of a graph involving some classical parameters
S Li, W Sun - Journal of Combinatorial Optimization, 2020 - Springer
Given a simple graph G, let Z (G),\, p (G),\, Φ (G), ex (G) Z (G), p (G), Φ (G), ex (G) and M (G),
respectively, be the zero forcing number, the number of pendant vertices, the cyclomatic …
respectively, be the zero forcing number, the number of pendant vertices, the cyclomatic …
Edge Forcing in Butterfly Networks
TM Rajalaxmi, I Rajasingh, RS Rajan - Fundamenta Informaticae, 2021 - fi.episciences.org
A zero forcing set is a set S of vertices of a graph G, called forced vertices of G, which are
able to force the entire graph by applying the following process iteratively: At any particular …
able to force the entire graph by applying the following process iteratively: At any particular …
Edge Forcing in Butterfly Networks
G Jessy Sujana, TM Rajalaxmi… - Fundamenta …, 2021 - content.iospress.com
A zero forcing set is a set S of vertices of a graph G, called forced vertices of G, which are
able to force the entire graph by applying the following process iteratively: At any particular …
able to force the entire graph by applying the following process iteratively: At any particular …
[PDF][PDF] RESOLVABILITY OF GRAPHS
C GRIGORIOUS - 2017 - nova.newcastle.edu.au
Graph theory is an established modelling method used in a variety of disciplines to describe
relationships between objects. A graph consists of a finite set of vertices (points, nodes), a …
relationships between objects. A graph consists of a finite set of vertices (points, nodes), a …