3 papers
math.CO2025
Bounds on the propagation radius in power domination
Imran Allie, Brandon du Preez, Dean Reagon +1
Let be a graph and let . It is said that \textit{dominates} . We say that \textit{monitors} vertices of as follows. Initially, all dominated…
math.CO2024
Zero forcing irredundant sets
Bryan A. Curtis, Leslie Hogben, Adriana Roux
Irredundance has been studied in the context of dominating sets, via the concept of private neighbor. Here irredundance of zero forcing sets is introduced via the concept of a priv…
math.CO2023
A new approach to b-coloring of regular graphs
Magda Dettlaff, Hanna Furmańczyk, Iztok Peterin +2
Let be a graph and c a proper k-coloring of G, i.e. any two adjacent vertices u and v have different colors c(u) and c(v). A proper k-coloring is a b-coloring if there exists a…