Sesión Matemática Discreta y Teoría de JuegosMaximum nullity of some generalized Petersen Graphs
Johann Bolckau Igrejas Lopes Johann Bolckau
UFF- Universidade Federal Fluminense , Brasil - Esta dirección de correo electrónico está siendo protegida contra los robots de spam. Necesita tener JavaScript habilitado para poder verlo.
Maximum nullity of a graph is defined as the largest nullity among symmetric matrices that respects the adjacency pattern of the graph. The zero forcing number is a combinatorial upper bound for the maximum nullity, so a natural question is when does equality hold. This question has been answered for many classes of graphs, but we focus on the generalized Petersen graphs. Equality has been proven for a couple of subfamilies and we prove it for additional cases, closing the case P(n,2).