Ključne besede: connected dominating set, connected domination, connected-domishold graph, forbidden induced subgraph characterization, split graph, chordal graph, minimal cutset, minimal separator, 1-Sperner hypergraph, threshold hypergraph, threshold Boolean function, polynomial-time algorithmObjavljeno v RUP: 04.04.2019; Ogledov: 2041; Prenosov: 158 Celotno besedilo (648,51 KB)
Ključne besede: lekisikografski product grafov, minimalna dominantna množica, dobro dominiran graf, nesvodljiva dominantna množica, lexicographic product of graphs, minimal dominating set, well-dominated graph, irreducible dominating setObjavljeno v RUP: 14.11.2017; Ogledov: 2148; Prenosov: 65 Povezava na celotno besedilo