Vertices belonging to all or to no minimum double dominating sets in trees

zbMath1076.05058MaRDI QIDQ2566903

Mostafa Blidia, Soufiane Khelifi, Mustapha Chellali

Publication date: 29 September 2005

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree ⋮ Vertices contained in all or in no minimum semitotal dominating set of a tree ⋮ Vertices belonging to all or to no minimum vertex-edge dominating sets in trees ⋮ Edges contained in all or in no minimum edge dominating set of a tree

This page was built for publication: Vertices belonging to all or to no minimum double dominating sets in trees