dc.contributor.author | Hanson, Skyler | |

dc.contributor.author | Paukner, Dawn | |

dc.contributor.author | Walker, Shanise | |

dc.date.accessioned | 2021-01-27T13:54:44Z | |

dc.date.available | 2021-01-27T13:54:44Z | |

dc.date.issued | 2019-05 | |

dc.identifier.uri | http://digital.library.wisc.edu/1793/81035 | |

dc.description | Color poster with text and images. | en_US |

dc.description.abstract | Zero forcing is a graph infection parameter which allows vertices of a graph to be colored using the color-change rule. Vertices of a graph are initially colored either blue or white. The color-change rule states that if a blue vertex has only one white neighbor then it can color its neighbor blue. A zero forcing set of a graph is a set of initially colored blue vertices such that all other vertices in the graph become blue when the color-change rule is applied. Zero forcing was first introduced in 2008 and has applications in quantum physics, computer science, power networks, and mathematical physics. The zero forcing polynomial of a graph counts the number of zero forcing sets of all possible sizes of a graph. Our research team is working to find a generalized formula for the zero forcing polynomial of a specific type of graph - the ladder graph. | en_US |

dc.description.sponsorship | University of Wisconsin--Eau Claire Office of Research and Sponsored Programs | en_US |

dc.language.iso | en_US | en_US |

dc.relation.ispartofseries | USGZE AS589; | |

dc.subject | Zero forcing polynomial | en_US |

dc.subject | Ladder graphs | en_US |

dc.subject | Posters | en_US |

dc.subject | Department of Mathematics | en_US |

dc.title | The Zero Forcing Polynomial of a Ladder Graph | en_US |

dc.type | Presentation | en_US |