Related papers: Matching, Path Covers, and Total Forcing Sets
Let $ G $ be a graph with the vertex set $ V(G) $ and $ S $ be a subset of $ V(G) $. Let $cl(S)$ be the set of vertices built from $S$, by iteratively applying the following propagation rule: if a vertex and all of its neighbors except one…
Let $G = (V,E)$ be a finite simple graph. Recall that a proper coloring of $G$ is a mapping $\varphi: V\to\{1,\ldots,k\}$ such that every color class induces an independent set. Such a $\varphi$ is called a semi-matching coloring if the…
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph are colored. A path in a total-colored graph is a {\it total monochromatic path} if all the edges and internal vertices on the path have the same…
The concept of zero forcing involves a dynamic coloring process by which blue vertices cause white vertices to become blue, with the goal of forcing the entire graph blue while choosing as few as possible vertices to be initially blue. Past…
Zero forcing can be described as a combinatorial game on a graph that uses a color change rule in which vertices change white vertices to blue. The throttling number of a graph minimizes the sum of the number of vertices initially colored…
Consider a discrete-time process on a graph $G$ where a set $B$ of initial vertices are chosen to be colored blue (the remainder being white) and then a time step consists of every currently blue vertex forcing all of its neighbors to…
A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors. The minimum number of colors necessary in…
A total coloring of a graph $G$ is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. An \emph{interval total $t$-coloring} of a graph $G$ is a total…
A total coloring of a graph $G = (V, E)$ is an assignment of colors to vertices and edges such that neither two adjacent vertices nor two incident edges get the same color, and, for each edge, the end-points and the edge itself receive…
In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph. We provide sharp upper and lower bounds on the connected…
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity / minimum rank of the family of symmetric matrices described by G. It is shown that for a…
Let $G$ be a simple graph. A total dominator coloring of $G$, is a proper coloring of the vertices of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic (TDC) number…
An independent edge set of graph $G$ is a matching, and is maximal if it is not a proper subset of any other matching of $G$. The number of all the maximal matchings of $G$ is denoted by $\Psi(G)$. In this paper, an algorithm to count…
A total graph is an ordered triple $(V_0, V_1, E)$, where $V_0, V_1$ are the sets of empty and full vertices, respectively, $V_0 \cap V_1 = \emptyset$, and the set of edges $E$ is a subset of \(\binom{V_0 \cup V_1}{2}\) $(E\cap(V_0 \cup…
The anti-forcing number of a perfect matching $M$ of a graph $G$ is the minimal number of edges not in $M$ whose removal to make $M$ as a unique perfect matching of the resulting graph. The set of anti-forcing numbers of all perfect…
Zero forcing is a process on a graph in which the goal is to force all vertices to become blue by applying a color change rule. Throttling minimizes the sum of the number of vertices that are initially blue and the number of time steps…
A forcing set $S$ in a combinatorial problem is a set of elements such that there is a unique solution that contains all the elements in $S$. An anti-forcing set is the symmetric concept: a set $S$ of elements is called an anti-forcing set…
A connected forcing set of a graph is a zero forcing set that induces a connected subgraph. In this paper, we introduce and study CF-dense graphs -- graphs in which every vertex belongs to some minimum connected forcing set. We identify…
We prove that for any graph $G$, the total chromatic number of $G$ is at most $\Delta(G)+2\left\lceil \frac{|V(G)|}{\Delta(G)+1} \right\rceil$. This saves one color in comparison with a result of Hind from 1992. In particular, our result…
A {\em restraint} on a (finite undirected) graph $G = (V,E)$ is a function $r$ on $V$ such that $r(v)$ is a finite subset of ${\mathbb N}$; a proper vertex colouring $c$ of $G$ is {\em permitted} by $r$ if $c(v) \not\in r(v)$ for all…