Global domination edge critical graphs

Authors

  • Desormeaux, Wyatt J.
  • Haynes, Teresa W.
  • Van Der Merwe, Lucas

Abstract

A set S of vertices in a graph G is a global dominating set of G if 5 simultaneously dominates both G and its complement G. The minimum cardinality of a global dominating set of G is the global domination number of G. We study the graphs for which removing any arbitrary edge from G and adding it to G decreases the global domination number.

Published

2017-09-09

How to Cite

Desormeaux, Wyatt J., Haynes, Teresa W., & Van Der Merwe, Lucas. (2017). Global domination edge critical graphs. Utilitas Mathematica, 104. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1188

Issue

Vol. 104 (2017): Volume 104, 2017

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.