On the vertices belonging to all, some, none minimum dominating set

09/06/2019
by   Valentin Bouquet, et al.
0

We characterize the vertices belonging to all minimum dominating sets, to some minimum dominating sets but not all, and to no minimum dominating set. We refine this characterization for some well studied sub-classes of graphs: chordal, claw-free, triangle-free. Also we exhibit some graphs answering to some open questions of the literature on minimum dominating sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2020

On Minimum Dominating Sets in cubic and (claw,H)-free graphs

Given a graph G=(V,E), S⊆ V is a dominating set if every v∈ V∖ S is adja...
research
02/20/2018

The Cut and Dominating Set Problem in A Steganographer Network

A steganographer network corresponds to a graphic structure that the inv...
research
09/13/2017

Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs

The Apollonian networks display the remarkable power-law and small-world...
research
08/21/2020

Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem

In metric search, worst-case analysis is of little value, as the search ...
research
08/05/2023

Independent dominating sets in planar triangulations

In 1996, Matheson and Tarjan proved that every near planar triangulation...
research
03/18/2021

Graphs with unique zero forcing sets and Grundy dominating sets

The concept of zero forcing was introduced in the context of linear alge...
research
02/05/2019

Average-case complexity of a branch-and-bound algorithm for min dominating set

The average-case complexity of a branch-and-bound algorithms for Minimum...

Please sign up or login with your details

Forgot password? Click here to reset