Trees with large paired-domination number

Authors

  • Haynes, Teresa W.
  • Henning, Michael A.

Abstract

A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G is bounded above by twice the domination number of G. We give a constructive characterization of the trees attaining this bound.

Published

2006-09-09

How to Cite

Haynes, Teresa W., & Henning, Michael A. (2006). Trees with large paired-domination number. Utilitas Mathematica, 71. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/415

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.