Topics
connected graphAutomobile
graphBook
In [10], the notion of the splitting graph of a graph was introduced. In this paper we compute the zero forcing number of the splitting graph of a graph and also obtain some bounds besides finding the exact value of this parameter. We prove for any connected graph Г of order n ≥ 2, Z[S(Г)] ≤ 2Z(Г) and also obtain many classes of graph in which Z[S(Г)] = 2Z(Г). Further, we show some classes of graphs in which Z[S(Г)] < 2Z(Г)
Zero forcing (also called graph infection) on a simple, undirected graph G is based on the color-cha...
In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial ...
Zero forcing number and positive semidefinite zero forcing number are important parameters in studyi...
AbstractThe zero forcing number of a graph is the minimum size of a zero forcing set. This parameter...
Let G be a simple undirected graph with each vertex colored either white or black, u be a black vert...
A subset ℤ ⊆ V(G) of initially colored black vertices of a graph G is known as a zero forcing set if...
The zero-forcing number, Z(G) is an upper bound for the maximum nullity of all symmetric matrices wi...
Given a graph G, the zero forcing number of G, Z(G), is the smallest cardinality of any set S of ver...
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric ...
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a gra...
summary:Zero forcing number has recently become an interesting graph parameter studied in its own ri...
The zero forcing number of a graph is the minimum size of a zero forcing set. This parameter is usef...
Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S...
The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symm...
The positive semidefinite zero forcing number Z+(G) of a graph G was introduced in [4]. We establish...
Zero forcing (also called graph infection) on a simple, undirected graph G is based on the color-cha...
In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial ...
Zero forcing number and positive semidefinite zero forcing number are important parameters in studyi...
AbstractThe zero forcing number of a graph is the minimum size of a zero forcing set. This parameter...
Let G be a simple undirected graph with each vertex colored either white or black, u be a black vert...
A subset ℤ ⊆ V(G) of initially colored black vertices of a graph G is known as a zero forcing set if...
The zero-forcing number, Z(G) is an upper bound for the maximum nullity of all symmetric matrices wi...
Given a graph G, the zero forcing number of G, Z(G), is the smallest cardinality of any set S of ver...
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric ...
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a gra...
summary:Zero forcing number has recently become an interesting graph parameter studied in its own ri...
The zero forcing number of a graph is the minimum size of a zero forcing set. This parameter is usef...
Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S...
The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symm...
The positive semidefinite zero forcing number Z+(G) of a graph G was introduced in [4]. We establish...
Zero forcing (also called graph infection) on a simple, undirected graph G is based on the color-cha...
In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial ...
Zero forcing number and positive semidefinite zero forcing number are important parameters in studyi...
Add to ORKG