Related papers: Characterizing the fullerene graphs with the minim…

Let $G$ be a simple, finite graph with vertex set $V(G)$ and edge set $E(G)$, where each vertex is either colored blue or white. Define the standard zero forcing process on $G$ with the following color-change rule: let $S$ be the set of all…

The fractional matching number of a graph G, is the maximum size of a fractional matching of G. The following sharp lower bounds for a graph G of order n are proved, and all extremal graphs are characterized in this paper. (1)The sum of the…

We give an algorithm that finds a zero forcing set which approximates the optimal size by a factor of $\text{pw}(G)+1$, where $\text{pw}(G)$ is the pathwidth of $G$. Starting from a path decomposition, the algorithm runs in $O(nm)$ time,…

The minimum completion (fill-in) problem is defined as follows: Given a graph family $\mathcal{F}$ (more generally, a property $\Pi$) and a graph $G$, the completion problem asks for the minimum number of non-edges needed to be added to $G$…

A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $S$ of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor…

Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$…

Given a family of graphs $\mathcal{F}$, a graph $G$ is $\mathcal{F}$-saturated if it is $\mathcal{F}$-free but the addition of any missing edge creates a copy of some $F \in \mathcal{F}$. The study of the minimum number of edges in…

Zero forcing in graphs is a coloring process where a colored vertex can force its unique uncolored neighbor to be colored. A zero forcing set is a set of initially colored vertices capable of eventually coloring all vertices of the graph.…

For two graphs $G$ and $F$, we say that $G$ is weakly $F$-saturated if $G$ contains no copy of $F$ as a subgraph and one could join all the nonadjacent pairs of vertices of $G$ in some order so that a new copy of $F$ is created at each…

Zero forcing (also called graph infection) on a simple, undirected graph $G$ is based on the color-change rule: If each vertex of $G$ is colored either white or black, and vertex $v$ is a black vertex with only one white neighbor $w$, then…

For a fixed graph $H$, a graph $G$ is called $H$-saturated if $G$ does not contain $H$ as a (not necessarily induced) subgraph, but $G+e$ contains a copy of $H$ for any $e\in E(\overline{G})$. The saturation number of $H$, denoted by ${\rm…

Zero forcing is an iterative graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum zero forcing set - a smallest set of initially colored…

The size-Ramsey number of a graph $F$ is the smallest number of edges in a graph $G$ with the Ramsey property for $F$, that is, with the property that any 2-colouring of the edges of $G$ contains a monochromatic copy of $F$. We prove that…

Zero forcing is an iterative graph coloring process studied for its wide array of applications. In this process, the vertices of the graph are initially designated as blue or white, and a zero forcing set is a set of initially blue vertices…

Say that an edge of a graph $G$ dominates itself and every other edge adjacent to it. An edge dominating set of a graph $G=(V,E)$ is a subset of edges $E' \subseteq E$ which dominates all edges of $G$. In particular, if every edge of $G$ is…

In a zero forcing process, vertices of a graph are colored black and white initially, and if there exists a black vertex adjacent to exactly one white vertex, then the white vertex is forced to be black. A zero blocking set is an initial…

In a graph G, a dominating set Df subset of V (G) is called a dom-forcing set if the sub-graph induced by Df must form a zero forcing set. The minimum cardinality of such a set is known as the dom-forcing number of the graph G, denoted by…

The fixing number of a graph $G$ is the order of the smallest subset $S$ of its vertex set $V(G)$ such that stabilizer of $S$ in $G$, $\Gamma_{S}(G)$ is trivial. Let $G_{1}$ and $G_{2}$ be disjoint copies of a graph $G$, and let…

An edge $e$ of a graph $G$ is called deletable for some orientation $o$ if the restriction of $o$ to $G-e$ is a strong orientation. Inspired by a problem of Frank, in 2021 H\"orsch and Szigeti proposed a new parameter for $3$-edge-connected…

A graph $G = (V,E)$ is globally rigid in $\mathbb{R}^d$ if for any generic placement $p : V \rightarrow \mathbb{R}^d$ of the vertices, the edge lengths $||p(u) - p(v)||, uv \in E$ uniquely determine $p$, up to congruence. In this paper we…