Zero forcing number of degree splitting graphs and complete degree splitting graphs
A subset ℤ ⊆ V(G) of initially colored black vertices of a graph G is known as a zero forcing set if we can alter the color of all vertices in G as black by iteratively applying the subsequent color change condition. At each step, any black colored vertex has exactly one white neighbor, then change...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2019-08-01
|
| Series: | Acta Universitatis Sapientiae: Mathematica |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/ausm-2019-0004 |