Graphs with disjoint 2-dominating sets

Michael A. Henning, Jerzy Topp

Research output: Contribution to journalComment/debate

Abstract

A subset D ⊆ V (G) is a dominating set of a multigraph G if every vertex in V (G) \ D has a neighbor in D, while D is a 2-dominating set of G if every vertex belonging to V (G) \ D is joined by at least two edges with a vertex or vertices in D. A graph G is a (2, 2)-dominated graph if it has a pair (D, D) of disjoint 2-dominating sets of vertices of G. In this paper we present two characterizations of minimal (2, 2)-dominated graphs.

Original languageEnglish
Pages (from-to)163-172
Number of pages10
JournalAustralasian Journal of Combinatorics
Volume83
Issue number1
Publication statusPublished - Jun 2022

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Graphs with disjoint 2-dominating sets'. Together they form a unique fingerprint.

Cite this