Universal perspectives on irredundance for X-set parameters
Preprint
Abstract
Universal definitions of irredundance for X-set parameters are presented using blocking sets. This approach is modeled on (domination) irredundance (which uses closed neighborhoods as blocking sets) and zero forcing irredundance (which uses forts). Results include a chain of inequalities between irredundance parameters and original parameters and the isomorphism theorem for TAR reconfiguration graphs of many irredundance parameters. These results are then applied to PSD forcing irredundance and vertex cover irredundance; the chain of inequalities also applies to skew forcing irredundance. The upper vertex cover irredundance number becomes part of the Domination Chain used in the study of (domination) irredundance. Based on the propagation processes involved in forcing, an alternate universal theory of irredundance is developed using closure operators.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- TAR Reconfiguration for Vertex Set ParametersLa Matematica, 2026
- Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set ParametersGraphs and Combinatorics, 2023
- An integer program for positive semidefinite zero forcing in graphsNetworks, 2020
- Domination chain: Characterisation, classical complexity, parameterised complexity and approximabilityDiscrete Applied Mathematics, 2020
- Computational approaches for zero forcing and related problemsEuropean Journal of Operational Research, 2019
- Effects of vertex degrees on the zero-forcing number and propagation time of a graphDiscrete Applied Mathematics, 2018
- Skew propagation time2018
- Zero forcing parameters and minimum rank problemsLinear Algebra and its Applications, 2010
- Total irredundance in graphsDiscrete Mathematics, 2002
- The sequence of upper and lower domination, independence and irredundance numbers of a graphDiscrete Mathematics, 1993