Current browse context:
cs.DM
Change to browse by:
References & Citations
Computer Science > Discrete Mathematics
Title: Words fixing the kernel network and maximum independent sets in graphs
(Submitted on 11 Jul 2023)
Abstract: The simple greedy algorithm to find a maximal independent set of a graph can be viewed as a sequential update of a Boolean network, where the update function at each vertex is the conjunction of all the negated variables in its neighbourhood. In general, the convergence of the so-called kernel network is complex. A word (sequence of vertices) fixes the kernel network if applying the updates sequentially according to that word. We prove that determining whether a word fixes the kernel network is coNP-complete. We also consider the so-called permis, which are permutation words that fix the kernel network. We exhibit large classes of graphs that have a permis, but we also construct many graphs without a permis.
Submission history
From: Maximilien Gadouleau [view email][v1] Tue, 11 Jul 2023 12:40:45 GMT (100kb,D)
Link back to: arXiv, form interface, contact.