Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)

A graph G, is λ-regular-stable if it has at least a maximum independent set I, such that for ∀v ∈ V(G)\I, the number of vertices in NG(V), ⨆ I, is constant, and equal to λ. Here we give some results for this class of graphs.