Counting dominating sets and related structures in graphs

Jonathan Cutler, A. J. Radcliffe

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

Abstract

We first consider some problems related to the maximum number of dominating (or total dominating) sets in a regular graph. Our techniques, centered around Shearer's entropy lemma, extend to a reasonably broad class of graph parameters enumerating vertex colorings that satisfy conditions on the multiset of colors appearing in neighborhoods (either open or closed). Dominating sets and total dominating sets are examples, as are graph colorings in which each vertex's neighborhood is not monochromatic (or rainbow). In the final section, we think about a generalization of dominating sets in a slightly different direction. Just as independent sets are homomorphisms into K2 with one vertex looped, we think of dominating sets as an example of what we call an existence homomorphism. Here our results are substantially less complete, though we do solve some natural problems.

Original languageEnglish
Pages (from-to)1593-1599
Number of pages7
JournalDiscrete Mathematics
Volume339
Issue number5
DOIs
StatePublished - 6 May 2016

Fingerprint

Dominating Set
Coloring
Counting
Graph in graph theory
Entropy
Color
Vertex Coloring
Graph Coloring
Multiset
Independent Set
Regular Graph
Homomorphisms
Homomorphism
Lemma
Closed
Vertex of a graph

Keywords

  • Dominating sets
  • Extremal enumeration
  • Shearer's lemma

Cite this

Cutler, Jonathan ; J. Radcliffe, A. / Counting dominating sets and related structures in graphs. In: Discrete Mathematics. 2016 ; Vol. 339, No. 5. pp. 1593-1599.
@article{422bff2028f14717bddfaa233d0c2112,
title = "Counting dominating sets and related structures in graphs",
abstract = "We first consider some problems related to the maximum number of dominating (or total dominating) sets in a regular graph. Our techniques, centered around Shearer's entropy lemma, extend to a reasonably broad class of graph parameters enumerating vertex colorings that satisfy conditions on the multiset of colors appearing in neighborhoods (either open or closed). Dominating sets and total dominating sets are examples, as are graph colorings in which each vertex's neighborhood is not monochromatic (or rainbow). In the final section, we think about a generalization of dominating sets in a slightly different direction. Just as independent sets are homomorphisms into K2 with one vertex looped, we think of dominating sets as an example of what we call an existence homomorphism. Here our results are substantially less complete, though we do solve some natural problems.",
keywords = "Dominating sets, Extremal enumeration, Shearer's lemma",
author = "Jonathan Cutler and {J. Radcliffe}, A.",
year = "2016",
month = "5",
day = "6",
doi = "10.1016/j.disc.2015.12.011",
language = "English",
volume = "339",
pages = "1593--1599",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "5",

}

Counting dominating sets and related structures in graphs. / Cutler, Jonathan; J. Radcliffe, A.

In: Discrete Mathematics, Vol. 339, No. 5, 06.05.2016, p. 1593-1599.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Counting dominating sets and related structures in graphs

AU - Cutler, Jonathan

AU - J. Radcliffe, A.

PY - 2016/5/6

Y1 - 2016/5/6

N2 - We first consider some problems related to the maximum number of dominating (or total dominating) sets in a regular graph. Our techniques, centered around Shearer's entropy lemma, extend to a reasonably broad class of graph parameters enumerating vertex colorings that satisfy conditions on the multiset of colors appearing in neighborhoods (either open or closed). Dominating sets and total dominating sets are examples, as are graph colorings in which each vertex's neighborhood is not monochromatic (or rainbow). In the final section, we think about a generalization of dominating sets in a slightly different direction. Just as independent sets are homomorphisms into K2 with one vertex looped, we think of dominating sets as an example of what we call an existence homomorphism. Here our results are substantially less complete, though we do solve some natural problems.

AB - We first consider some problems related to the maximum number of dominating (or total dominating) sets in a regular graph. Our techniques, centered around Shearer's entropy lemma, extend to a reasonably broad class of graph parameters enumerating vertex colorings that satisfy conditions on the multiset of colors appearing in neighborhoods (either open or closed). Dominating sets and total dominating sets are examples, as are graph colorings in which each vertex's neighborhood is not monochromatic (or rainbow). In the final section, we think about a generalization of dominating sets in a slightly different direction. Just as independent sets are homomorphisms into K2 with one vertex looped, we think of dominating sets as an example of what we call an existence homomorphism. Here our results are substantially less complete, though we do solve some natural problems.

KW - Dominating sets

KW - Extremal enumeration

KW - Shearer's lemma

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

U2 - 10.1016/j.disc.2015.12.011

DO - 10.1016/j.disc.2015.12.011

M3 - Article

VL - 339

SP - 1593

EP - 1599

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 5

ER -