Contents

Ars Combinatoria

  • Research article

Trees with Unique Minimum Paired-Dominating Sets

Mustapha Chellali1, Teresa W.Haynes2
1Department of Mathematics University of Blida B.P. 270, Ouled Yaich, Blida, Algeria
2Department of Mathematics East Tennessee State University Johnson City, TN 37614 USA
  • Published: 31/10/2004

Abstract

A paired-dominating set of a graph \(G\) is a dominating set of vertices whose induced subgraph has a perfect matching. We characterize the trees having unique minimum paired-dominating sets.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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

Citation
Mustapha Chellali, Teresa W.Haynes. Trees with Unique Minimum Paired-Dominating Sets[J], Ars Combinatoria, Volume 073. 3-12. .