Block graphs with unique minimum dominating sets

DOI10.1016/S0012-365X(01)00196-0zbMath0982.05073OpenAlexW2156778964MaRDI QIDQ5948982

Miranca Fischermann

Publication date: 29 March 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00196-0

zbMATH Keywords

characterizationsdominationblock graphunique dominating set

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

More on the unimodality of domination polynomial of a graph ⋮ On accurate domination in graphs ⋮ On unique minimum dominating sets in some Cartesian product graphs ⋮ Some rainbow problems in graphs have complexity equivalent to satisfiability problems ⋮ Graphs with equal domination and certified domination numbers ⋮ Unique (optimal) solutions: complexity results for identifying and locating-dominating codes ⋮ Unique irredundance, domination and independent domination in graphs ⋮ Unique minimum semipaired dominating sets in trees

This page was built for publication: Block graphs with unique minimum dominating sets