Opuscula Math. 33, no. 4 (2013), 763-783
http://dx.doi.org/10.7494/OpMath.2013.33.4.763

 
Opuscula Mathematica

All graphs with paired-domination number two less than their order

Włodzimierz Ulatowski

Abstract. Let \(G=(V,E)\) be a graph with no isolated vertices. A set \(S\subseteq V\) is a paired-dominating set of \(G\) if every vertex not in \(S\) is adjacent with some vertex in \(S\) and the subgraph induced by \(S\) contains a perfect matching. The paired-domination number \(\gamma_{p}(G)\) of \(G\) is defined to be the minimum cardinality of a paired-dominating set of \(G\). Let \(G\) be a graph of order \(n\). In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater described graphs \(G\) with \(\gamma_{p}(G)=n\) and also graphs with \(\gamma_{p}(G)=n-1\). In this paper we show all graphs for which \(\gamma_{p}(G)=n-2\).

Keywords: paired-domination, paired-domination number.

Mathematics Subject Classification: 05C69.

Full text (pdf)

  • Włodzimierz Ulatowski
  • Gdańsk University of Technology, Department of Technical Physics and Applied Mathematics, Narutowicza 11/12, 80–952 Gdańsk, Poland
  • Received: 2013-02-27.
  • Revised: 2013-05-14.
  • Accepted: 2013-05-21.
Opuscula Mathematica - cover

Cite this article as:
Włodzimierz Ulatowski, All graphs with paired-domination number two less than their order, Opuscula Math. 33, no. 4 (2013), 763-783, http://dx.doi.org/10.7494/OpMath.2013.33.4.763

Download this article's citation as:
a .bib file (BibTeX),
a .ris file (RefMan),
a .enw file (EndNote)
or export to RefWorks.

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.