Results 21 to 30 of about 419,100 (266)
On zero forcing number of graphs and their complements [PDF]
Discrete Mathematics, Algorithms and Applications, 2015 The 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)\S are colored white) such that V(G) is turned black after finitely many applications of "the color-change rule": a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex.
Eroh, Linda, Kang, Cong X., Yi, Eunjeong
openaire +3 more sources
Fractional Zero Forcing via Three-color Forcing Games [PDF]
, 2015 An $r$-fold analogue of the positive semidefinite zero forcing process that is carried out on the $r$-blowup of a graph is introduced and used to define the fractional positive semidefinite forcing number. Properties of the graph blowup when colored with
Hogben, Leslie +4 more
core +4 more sources
Line graphs: Their maximum nullities and zero forcing numbers [PDF]
Czechoslovak Mathematical Journal, 2016 The main aim of this paper is to analyze the maximum nullity and zero forcing number, and their positive counterparts, for general families of line graphs associated with graphs possessing some specific properties. In [\textit{F. Barioli} et al., Linear Algebra Appl. 428, No.
Fallat, Shaun, Soltani, Abolghasem
openaire +2 more sources
Maximum nullity and zero forcing of circulant graphs
Special Matrices, 2020 The zero forcing number of a graph has been applied to communication complexity, electrical power grid monitoring, and some inverse eigenvalue problems.
Duong Linh +4 more
doaj +1 more source
The Bipartite Zero Forcing Set for a Full Sign Pattern Matrix
Mathematics, 2020 For an m × n sign pattern P, we define a signed bipartite graph B ( U , V ) with one set of vertices U = { 1 , 2 , … , m } based on rows of P and the other set of vertices V = { 1 ′ , 2 ′ , … ,
Gu-Fang Mou +2 more
doaj +1 more source
A Periodically Rotating Distributed Forcing of Flow over a Sphere for Drag Reduction
Mathematics, 2023 In the present study, we propose a periodically rotating distributed forcing for turbulent flow over a sphere for its drag reduction. The blowing/suction forcing is applied on a finite slot of the sphere surface near the flow separation, and unsteady ...
Donggun Son, Jungil Lee
doaj +1 more source
Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs [PDF]
Graphs and Combinatorics, 2018 15 ...
Aras Erzurumluoğlu +2 more
openaire +3 more sources
The failed zero forcing number of a graph [PDF]
Involve, a Journal of Mathematics, 2015 Given a graph G, the zero forcing number of G, Z(G), is the smallest cardinality of any set S of vertices on which repeated applications of the color change rule results in all vertices joining S. The color change rule is: if a vertex v is in S, and exactly one neighbor u of v is not in S, then u joins S in the next iteration.
Fetcie, Katherine +2 more
openaire +2 more sources
A Short Proof for a Lower Bound on the Zero Forcing Number
Discussiones Mathematicae Graph Theory, 2020 We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number Z(G) of a graph G. More specifically, we show that Z(G) ≥ (g − 2)(δ − 2) + 2 for every graph G of girth g at least 3 and minimum degree δ at
Fürst Maximilian, Rautenbach Dieter
doaj +1 more source
Throttling positive semidefinite zero forcing propagation time on graphs [PDF]
, 2018 Zero forcing is a process on a graph that colors vertices blue by starting with some of the vertices blue and applying a color change rule. Throttling minimizes the sum of the size of the initial blue vertex set and the number of the time steps needed to
Carlson, Joshua +7 more
core +4 more sources