A princess in the kingdom of domination

Authors

  • Chartrand, Gary
  • Henning, Michael A.
  • Zhang, Ping

Abstract

A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number of G is the minimum cardinality of a dominating set of G. In this paper, we survey contributions to domination theory in graphs by Teresa W. Haynes.

Published

2014-06-09

How to Cite

Chartrand, Gary, Henning, Michael A., & Zhang, Ping. (2014). A princess in the kingdom of domination. Utilitas Mathematica, 94. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1073

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.