Reversing monoid actions and domination in graphs

arXiv2205.06341MaRDI QIDQ6399031FDOQ6399031

Mehmet Akif Erdal

Publication date: 12 May 2022

Abstract: Given a graph $G=(V,E)$, a set of vertices $DsubseteqV$ is called a dominating set if every vertex in $$ is adjacent to a vertex in $D$, and a subset $BsubseteqV$ is called a nonblocking set if $V-B$ is a dominating set. In this paper, we introduce a graph dynamical systems detecting vertex sets that are simultaneously dominating and nonblocking sets via reversing the action of the system. Moreover, by using actions of multiple such graph dynamical systems we define actions of free monoid on two letters for which elements in the reverse action corresponds to more special dominating sets.

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Dynamical systems involving maps of trees and graphs (37E25) Actions of groups and semigroups; invariant theory (associative rings and algebras) (16W22)

This page was built for publication: Reversing monoid actions and domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6399031)