Name
Abstract | ||
|---|---|---|
A set Z of vertices of a graph G is a zero forcing set of G if iteratively adding to Z vertices from V(G)∖Z that are the unique neighbor in V(G)∖Z of some vertex in Z, results in the entire vertex set V(G) of G. The zero forcing number Z(G) of G is the minimum cardinality of a zero forcing set of G. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.dam.2016.06.004 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Zero forcing,Path cover | Discrete mathematics,Combinatorics,Bound graph,Vertex (geometry),Induced subgraph,Degree (graph theory),Connectivity,Partition (number theory),Conjecture,Path cover,Mathematics | Journal |
Volume | ISSN | Citations |
214 | 0166-218X | 8 |
PageRank | References | Authors |
1.03 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Gentner | 1 | 22 | 4.46 |
| Lucia Draque Penso | 2 | 196 | 20.46 |
| Dieter Rautenbach | 3 | 946 | 138.87 |
| Uéverton S. Souza | 4 | 20 | 21.12 |