Contents

Ars Combinatoria

  • Research article

Trees with Equal Domination and Paired-domination Numbers

Teresa W.Haynes1, Michael A.Henning2, Peter J.Slater3
1Department of Mathematics East Tennessee State University Johnson City, TN 37614-0002 USA
2School of Mathematics, Statistics, & Information Technology University of KwaZulu-Natal Pietermaritzburg, 3209 South Africa
3Mathematical Sciences University of Alabama in Huntsville Huntsville, AL 35899 USA
  • Published: 31/07/2005

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 the minimum cardinality of a paired-dominating set of \(G\), and is obviously bounded below by the domination number of \(G\). We give a constructive characterization of the trees with equal domination and paired-domination numbers.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Teresa W.Haynes, Michael A.Henning, Peter J.Slater. Trees with Equal Domination and Paired-domination Numbers[J], Ars Combinatoria, Volume 076. 169-175. .