Results 1 to 10 of about 23,593 (263)
Reconfiguration graphs of zero forcing sets
Discrete Applied Mathematics, 2023 This paper begins the study of reconfiguration of zero forcing sets, and more specifically, the zero forcing graph. Given a base graph $G$, its zero forcing graph, $\mathscr{Z}(G)$, is the graph whose vertices are the minimum zero forcing sets of $G$ with an edge between vertices $B$ and $B'$ of $\mathscr{Z}(G)$ if and only if $B$ can be obtained from $
Jesse Geneson +2 more
exaly +5 more sources
Connected zero forcing sets and connected propagation time of graphs [PDF]
Transactions on Combinatorics, 2020 The zero forcing number $Z(G)$ of a graph $G$ is the minimum cardinality of a set $S$ with colored (black) vertices which forces the set $V(G)$ to be colored (black) after some times.
Maryam Khosravi +2 more
doaj +3 more sources
The Bipartite Zero Forcing Set for a Full Sign Pattern Matrix [PDF]
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 +2 more sources
Characterization of All Graphs with a Failed Skew Zero Forcing Number of 1
Mathematics, 2022 Given a graph G, the zero forcing number of G, Z(G), is the minimum cardinality of any set S of vertices of which repeated applications of the forcing rule results in all vertices being in S.
Aidan Johnson +2 more
doaj +3 more sources
GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED [PDF]
Journal of Algebraic Systems, 2021 A subset of the vertex set of a graph $G$ is called a zero forcing set if by considering them colored and, as far as possible, a colored vertex with exactly one non-colored neighbor forces its non-colored neighbor to get colored, then the whole vertices ...
M. Alishahi, E. Rezaei-Sani
doaj +1 more source
Signed zero forcing number and controllability for a networks system with a directed hypercube [PDF]
MATEC Web of Conferences, 2022 The controllability for complex network system is to find the minimum number of leaders for the network system to achieve effective control of the global networks.
Mou Gufang, Zhang Qiuyan
doaj +1 more source
Fuzzy Forcing Set on Fuzzy Graphs [PDF]
Journal of Mahani Mathematical Research, 2019 The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time
Layia Aliahmadipour, Saeedeh Rashidi
doaj +1 more source
Forcing Parameters in Fully Connected Cubic Networks
Mathematics, 2022 Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem.
Yongsheng Rao +4 more
doaj +1 more source
An Inverse Approach for Finding Graphs with a Failed Zero Forcing Number of k
Mathematics, 2023 For a 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 forcing rule results in all vertices being included in S.
Chirag Kaudan +2 more
doaj +1 more source
Impact of negative and positive CO2 emissions on global warming metrics using an ensemble of Earth system model simulations [PDF]
Biogeosciences, 2022 The benefits of implementing negative emission technologies in the global warming response to cumulative carbon emissions until the year 2420 are assessed following the shared socioeconomic pathway (SSP) 1-2.6, the sustainable development scenario, with ...
N. Vakilifard +7 more
doaj +1 more source