On the P₃-hull number and infecting times of generalized Petersen graphs
From MaRDI portal
Publication:6387246
arXiv2201.00078MaRDI QIDQ6387246FDOQ6387246
Authors: Daniel Herden, Jonathan Meddaugh, Mark Roger Sepanski, Isaac Echols, Nina Garcia-Montoya, Cordell C. Hammon, Guanjie Huang, Adam Kraus, J. Marchena-Menéndez, Jasmin Mohn, Rafael Morales Jiménez 
Publication date: 31 December 2021
Abstract: The -hull number of a graph is the minimum cardinality of an infecting set of vertices that will eventually infect the entire graph under the rule that uninfected nodes become infected if two or more neighbors are infected. In this paper, we study the -hull number for generalized Petersen graphs and a number of closely related graphs that arise from surgery or more generalized permutations. In addition, the number of components of the complement of an infecting set of minimum cardinality is calculated for the generalized Petersen graph and shown to always be or . Moreover, infecting times for infecting sets of minimum cardinality are studied. Bounds are provided and complete information is given in special cases.
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)
This page was built for publication: On the $P_3$-hull number and infecting times of generalized Petersen graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6387246)
