Dominating properties of star complements (Q2724044)

Let \(\mu\) be an eigenvalue of multiplicity \(m\) of a graph \(G\) and let \(X\) be a set of \(m\) vertices of \(G\). The subgraph \(G-X\) is called a star complement of \(G\) for the eigenvalue \(\mu\) if \(\mu\) is not an eigenvalue of \(G-X\). If \(\mu \neq 0\), vertices of a star complement form a dominating set in \(G\). The authors study related dominating properties, in particular, in the context of memoryless communication networks.