Ključne besede: weighted efficient domination, bounded degree vertices, k-Bounded Weighted Efficient Domination, polynomial-time algorithm, graph algorithmsObjavljeno v RUP: 21.01.2019; Ogledov: 1772; Prenosov: 282 Povezava na celotno besedilo