Results 241 to 250 of about 419,100 (266)
Some of the next articles are maybe not open access.
On graphs maximizing the zero forcing number
Discrete Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi-Ping Liang, Shou-Jun Xu
openaire +2 more sources
On the Zero Forcing Number of Trees
Iranian Journal of Science and Technology, Transactions A: Science, 2021Let G be a graph such that the color of its vertices is white or black. A dynamic vertex coloring for G is defined as follows. One starts with a certain set of black vertices. Then, at each time step, a black vertex with exactly one white neighbor forces its white neighbor to become black.
openaire +1 more source
Zero forcing number of fuzzy graphs with application
Journal of Intelligent & Fuzzy Systems, 2020We introduce and study forcing number for fuzzy graphs. Also, we compute zero forcing numbers for some classes of graphs and extend this concept to fuzzy graphs. In this regard we obtain upper bounds for zero forcing of some classes of fuzzy graphs. We will proceed to obtain a new algorithm to computing zero forcing set and finding a formula for zero ...
Karbasioun, Asefeh, Ameri, R.
openaire +1 more source
The Zero Forcing Number of Graphs with the Matching Number and the Cyclomatic Number
Graphs and Combinatorics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu Jing, Wenqian Zhang, Shengjin Ji
openaire +1 more source
On the Zero Forcing Number of Bijection Graphs
2016The zero forcing number of a graph is a graph parameter based on a color change process, which starts with a state, where all vertices are colored either black or white. In the next step a white vertex turns black, if it is the only white neighbor of some black vertex, and this step is then iterated.
Denys Shcherbak +2 more
openaire +1 more source
On Zero Forcing Number of Permutation Graphs
2012Zero forcing number, Z(G), of a graph G is the minimum cardinality of a set S of black vertices (whereas vertices in \(V(G)\!\setminus\!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 black if it is the only white neighbor of a black vertex.
openaire +1 more source
The zero forcing number of claw-free cubic graphs
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mengya He +3 more
openaire +1 more source
Zero forcing number of a graph in terms of the number of pendant vertices
Linear and Multilinear Algebra, 2020Dein Wong
exaly
Proof of a conjecture on the zero forcing number of a graph
Discrete Applied Mathematics, 2016Baoyindureng Wu
exaly