Acyclic total dominating sets in cubic graphs

Wayne Goddard; Michael A. Henning

doi:10.2298/AADM170315009G

Acyclic total dominating sets in cubic graphs

Wayne Goddard, Michael A. Henning

Mathematics and Applied Mathematics

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

We show that every cubic graph has a total dominating set D such that the subgraph induced by D is acyclic. As a consequence, an old result attributed to Berge follows.

Original language	English
Pages (from-to)	73-84
Number of pages	12
Journal	Applicable Analysis and Discrete Mathematics
Volume	13
Issue number	1
DOIs	https://doi.org/10.2298/AADM170315009G
Publication status	Published - 1 Apr 2019

Keywords

Cubic graph
Independent dominating set
Total domination

ASJC Scopus subject areas

Analysis
Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.2298/AADM170315009G

Cite this

@article{e85d88c4990d43da8a1c148d0664c1a6,

title = "Acyclic total dominating sets in cubic graphs",

abstract = "We show that every cubic graph has a total dominating set D such that the subgraph induced by D is acyclic. As a consequence, an old result attributed to Berge follows.",

keywords = "Cubic graph, Independent dominating set, Total domination",

author = "Wayne Goddard and Henning, {Michael A.}",

note = "Publisher Copyright: {\textcopyright} 2018 - Applicable Analysis and Discrete Mathematics.",

year = "2019",

month = apr,

day = "1",

doi = "10.2298/AADM170315009G",

language = "English",

volume = "13",

pages = "73--84",

journal = "Applicable Analysis and Discrete Mathematics",

issn = "1452-8630",

publisher = "University of Belgrade",

number = "1",

}

TY - JOUR

T1 - Acyclic total dominating sets in cubic graphs

AU - Goddard, Wayne

AU - Henning, Michael A.

PY - 2019/4/1

Y1 - 2019/4/1

N2 - We show that every cubic graph has a total dominating set D such that the subgraph induced by D is acyclic. As a consequence, an old result attributed to Berge follows.

AB - We show that every cubic graph has a total dominating set D such that the subgraph induced by D is acyclic. As a consequence, an old result attributed to Berge follows.

KW - Cubic graph

KW - Independent dominating set

KW - Total domination

UR - http://www.scopus.com/inward/record.url?scp=85065513294&partnerID=8YFLogxK

U2 - 10.2298/AADM170315009G

DO - 10.2298/AADM170315009G

M3 - Article

AN - SCOPUS:85065513294

SN - 1452-8630

VL - 13

SP - 73

EP - 84

JO - Applicable Analysis and Discrete Mathematics

JF - Applicable Analysis and Discrete Mathematics

IS - 1

ER -

Acyclic total dominating sets in cubic graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this